A note on scheduling jobs with missing operations in permutation flow shops

ISSN： 0020-7543

Source： International Journal of Production Research, Vol.36, Iss.9, 1998-09, pp. : 2627-2630

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

Adaptive scheduling of batch servers in flow shops

By Van Der Zee D. J.

International Journal of Production Research, Vol. 40, Iss. 12, 2002-08 ,pp. : 2811-2833

Taylor & Francis Ltd

Access to resources Recommend Favorite

Permutation flow shops with exact time lags to minimise maximum lateness

By Fondrevelle J.

International Journal of Production Research, Vol. 47, Iss. 23, 2009-08 ,pp. : 6759-6775

Taylor & Francis Ltd

Access to resources Recommend Favorite

Permutation flow shop scheduling with earliness and tardiness penalties

By Chandra Pankaj

International Journal of Production Research, Vol. 47, Iss. 20, 2009-01 ,pp. : 5591-5610

Taylor & Francis Ltd

Access to resources Recommend Favorite

Scheduling flow shops with blocking using a discrete self-organising migrating algorithm

By Davendra Donald

International Journal of Production Research, Vol. 51, Iss. 8, 2013-04 ,pp. : 2200-2218

Taylor & Francis Ltd

Access to resources Recommend Favorite

A genetic algorithm for solving the economic lot scheduling problem in flow shops

By Huang Jia-Yen

International Journal of Production Research, Vol. 46, Iss. 14, 2008-07 ,pp. : 3737-3761

Taylor & Francis Ltd

Access to resources Recommend Favorite