Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation

Author： Framinan J.M. Leisten R. Ruiz-Usano R.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.141, Iss.3, 2002-09, pp. : 559-569

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan

By Riane F. Artiba A. E. Elmaghraby S.

European Journal of Operational Research, Vol. 109, Iss. 2, 1998-09 ,pp. : 321-329

Elsevier

Access to resources Recommend Favorite

The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime

By Allahverdi A.

European Journal of Operational Research, Vol. 147, Iss. 2, 2003-06 ,pp. : 373-396

Elsevier

Access to resources Recommend Favorite

An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs

By Rajendran C. Ziegler H.

European Journal of Operational Research, Vol. 103, Iss. 1, 1997-11 ,pp. : 129-138

Elsevier

Access to resources Recommend Favorite

Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling

By Sun X. Morizawa K. Nagasawa H.

European Journal of Operational Research, Vol. 146, Iss. 3, 2003-05 ,pp. : 498-516

Elsevier

Access to resources Recommend Favorite

Minimizing makespan subject to minimum total flow-time on identical parallel machines

By Gupta J.N.D. Ruiz-Torres A.J.

European Journal of Operational Research, Vol. 125, Iss. 2, 2000-09 ,pp. : 370-380

Elsevier

Access to resources Recommend Favorite