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

Author： Riane F.   Artiba A.   E. Elmaghraby S.  

Publisher： Elsevier

ISSN： 0377-2217

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

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

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

By Framinan J.M.   Leisten R.   Ruiz-Usano R.  

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

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

Application of Hybrid Firefly Algorithm-Tabu Search Technique to Minimize the Makespan in Job Shop Scheduling problem

By  

International Journal of Applied Industrial Engineering (IJAIE), Vol. 3, Iss. 2, 2016-07 ,pp. : 1-21

IGI Global_journal

Access to resources Recommend Favorite

An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns

By Alcaide D.   Rodriguez-Gonzalez A.   Sicilia J.  

European Journal of Operational Research, Vol. 140, Iss. 2, 2002-07 ,pp. : 384-398

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