Analysis of antithetic sequences in flowshop scheduling to minimize makespan

Author： Moras R.   Smith M. L.   Kumar K. S.   Azim M. A.  

Publisher： Taylor & Francis Ltd

ISSN： 1366-5871

Source： Production Planning and Control, Vol.8, Iss.8, 1997-12, pp. : 780-787

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 Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking

By Ronconi Débora  

Annals of Operations Research, Vol. 138, Iss. 1, 2005-09 ,pp. : 53-65

Springer Publishing Company

Access to resources Recommend Favorite

Scheduling parallel jobs to minimize the makespan

By Johannes Berit  

Journal of Scheduling, Vol. 9, Iss. 5, 2006-10 ,pp. : 433-452

Springer Publishing Company

Access to resources Recommend Favorite

Flowshop/No-idle Scheduling to Minimize Total Elapsed Time

By Narain Laxmi   Bagga P.  

Journal of Global Optimization, Vol. 33, Iss. 3, 2005-11 ,pp. : 349-367

Springer Publishing Company

Access to resources Recommend Favorite

A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization

By Chakravarthy K.   Rajendran C.  

Production Planning and Control, Vol. 10, Iss. 7, 1999-10 ,pp. : 707-714

Taylor & Francis Ltd

Access to resources Recommend Favorite

A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan

By Yuan Jinjiang  

Journal of Scheduling, Vol. 14, Iss. 4, 2011-08 ,pp. : 361-369

Springer Publishing Company

Access to resources Recommend Favorite