A rule-centric memetic algorithm to minimize the number of tardy jobs in the job shop

ISSN： 0020-7543

Source： International Journal of Production Research, Vol.46, Iss.24, 2008-12, pp. : 6913-6931

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

Sequence-dependent flow shop scheduling problem minimising the number of tardy jobs

By Varmazyar Mohsen Salmasi Nasser

International Journal of Production Research, Vol. 50, Iss. 20, 2012-10 ,pp. : 5843-5858

Taylor & Francis Ltd

Access to resources Recommend Favorite

Job shop scheduling with a genetic algorithm and machine learning

By Lee C.-Y. Piramuthu S. Tsai Y.-K.

International Journal of Production Research, Vol. 35, Iss. 4, 1997-04 ,pp. : 1171-1191

Taylor & Francis Ltd

Access to resources Recommend Favorite

Integrated job release and shop-floor scheduling to minimize WIP and meet due-dates

By Zozom Jr A.

International Journal of Production Research, Vol. 41, Iss. 1, 2003-01 ,pp. : 31-45

Taylor & Francis Ltd

Access to resources Recommend Favorite

Minimizing tardy jobs in a two-stage hybrid flowshop

By Gupta J. N. D. Tunc E. A.

International Journal of Production Research, Vol. 36, Iss. 9, 1998-09 ,pp. : 2397-2417

Taylor & Francis Ltd

Access to resources Recommend Favorite

An analogue genetic algorithm for solving job shop scheduling problems

By Al-Hakim L.

International Journal of Production Research, Vol. 39, Iss. 7, 2001-05 ,pp. : 1537-1548

Taylor & Francis Ltd

Access to resources Recommend Favorite