Minimising the weighted number of tardy jobs in a hybrid flow shop with genetic algorithm

ISSN： 1362-3052

Source： International Journal of Computer Integrated Manufacturing, Vol.22, Iss.8, 2009-08, pp. : 745-757

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 Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks

By Oĝuz Ceyda Ercan M.

Journal of Scheduling, Vol. 8, Iss. 4, 2005-07 ,pp. : 323-351

Springer Publishing Company

Access to resources Recommend Favorite

Minimizing Weighted Number of Early and Tardy Jobs with a Common Due Window Involving Location Penalty

By Yeung W.K. Oğuz C. Cheng T.C.E.

Annals of Operations Research, Vol. 108, Iss. 1-4, 2001-11 ,pp. : 33-54

Springer Publishing Company

Access to resources Recommend Favorite

A hybrid genetic algorithm for the job shop scheduling problems

By Park B.J. Choi H.R. Kim H.S.

Computers and Industrial Engineering, Vol. 45, Iss. 4, 2003-12 ,pp. : 597-613

Elsevier

Access to resources Recommend Favorite

Genetic algorithm for minimizing tardiness in flow-shop scheduling

By Onwubolu G. C. Mutingi M.

Production Planning and Control, Vol. 10, Iss. 5, 1999-07 ,pp. : 462-471

Taylor & Francis Ltd

Access to resources Recommend Favorite

An Exact Method to Minimize the Number of Tardy Jobs in Single Machine Scheduling

By Dauzère-Pérès Stéphane Sevaux Marc

Journal of Scheduling, Vol. 7, Iss. 6, 2004-11 ,pp. : 405-420

Springer Publishing Company

Access to resources Recommend Favorite