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

References

• Baptiste , P. 1999 . An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs . Operations Research Letters , 24 : 175 – 180 .
   Google Scholar
• Baptiste , P. 1999 . Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times . Journal of Scheduling , 2 : 245 – 252 .
   Google Scholar
• Baptiste , P. , Peridy , L. and Pinson , E. 2003 . A branch and bound to minimize the number of late jobs on a single machine with release time constraints . European Journal of Operational Research , 144 : 1 – 11 .
   Web of Science ®Google Scholar
• Bertel , S. and Billaut , J. C. 2004 . A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation . European Journal of Operational Research , 159 : 651 – 662 .
   Web of Science ®Google Scholar
• Bulfin , R. L. and M'Hallah , R. 2003 . Minimizing the weighted number of tardy jobs on a two-machine flow shop . Computers and Operations Research , 30 : 1887 – 1900 .
   Web of Science ®Google Scholar
• Chang , P. C. and Su , L. H. 2001 . Scheduling n jobs on one machine to minimize the maximum lateness with a minimum number of tardy jobs . Computers and Industrial Engineering , 40 : 349 – 360 .
   Web of Science ®Google Scholar
• Chu , C. 1996 . A new class of scheduling criteria and their optimization . RAIRO Operations Research , 30 ( 2 ) : 489 – 509 .
   Google Scholar
• Dauzère-Pérès , S. 1995 . Minimizing late jobs in the general one machine scheduling problem . European Journal of Operational Research , 81 : 134 – 142 .
   Web of Science ®Google Scholar
• Dauzère-Pérès , S. , Roux , W. and Lasserre , J. B. 1998 . Multi-resource shop scheduling with resource flexibility . European Journal of Operational Research , 107 : 289 – 305 .
   Web of Science ®Google Scholar
• Dauzère-Pérès , S. and Sevaux , M. 2004 . An exact method to minimize the number of tardy jobs in single machine scheduling . Journal of Scheduling , 7 : 405 – 420 .
   Google Scholar
• Desprez , C. , Chu , C. and Chu , F. . A genetic algorithm for minimizing the weighted number of tardy jobs. International Conference on Service Systems and Service Management . October 25–27 , Troyes. pp. 1271 – 1276 .
   Google Scholar
• Holland , J. H. 1975 . Adaptation in natural and artificial systems , Ann Arbor, MI : The University of Michigan Press .
   Google Scholar
• Kacem , I. 2003 . Ordonnancement multi-critère des job shops flexibles: formulation, bornes inférieures et approche évolutionniste cooperative Ph.D. thesis, Ecole Centrale de Lille, University of Lille 1, pp. 43–63
   Google Scholar
• Lee , C. Y. and Choi , J. Y. 1995 . A genetic algorithm for job sequencing problems with disctinct due dates and general early-tardy penalty weights . Computers Operations Research , 22 ( 8 ) : 857 – 869 .
   Web of Science ®Google Scholar
• Lee , K. M. , Yamakawa , T. and Lee , K. M. . A genetic algorithm for general machine scheduling problems . 2nd International Conference on Knowledge-Based Intelligent Electronic Systems . April 21–23 , Adelaide. Vol. 2 , pp. 60 – 66 .
   Google Scholar
• Linn , R. and Zhang , W. 1999 . Hybrid flow shop scheduling: a survey . Computers and Industrial Engineering , 37 : 57 – 61 .
   Web of Science ®Google Scholar
• Moore , J. M. 1968 . An n jobs, one machine sequencing algorithm for minimizing the number of late jobs . Management Science , 15 ( 1 ) : 102 – 106 .
   Web of Science ®Google Scholar
• Negenman , E. G. 2001 . Local search algorithms for the multiprocessor flow shop scheduling problem . European Journal of Operational Research , 128 : 147 – 158 .
   Google Scholar
• Onwubolu , G. C. and Mutingi , M. 1999 . Genetic algorithm for minimizing tardiness in flow shop scheduling . Production Planning and Control , 10 ( 5 ) : 462 – 471 .
   Web of Science ®Google Scholar
• Portmann , M. C. . Genetic algorithms and scheduling: A state of the art and some propositions . Proceedings of the Workshop on Production Planning and Control . Mons, Belgium. pp. i – xxiv .
   Google Scholar
• Qi , X. , Yu , G. and Bard , J. F. 2002 . Single machine scheduling with assignable due dates . Discrete Applied Mathematics , 122 : 211 – 233 .
   Google Scholar
• Sevaux , M. and Dauzère-Pérès , S. 2003 . Genetic algorithms to minimize the weighted number of late jobs on a single machine . European Journal of Operational Research , 151 : 296 – 306 .
   Web of Science ®Google Scholar
• Sriskandarajah , C. 1990 . A note on generalized due dates scheduling problems . Naval Research Logistics , 37 : 587 – 597 .
   Web of Science ®Google Scholar
• Wong , C. S. , Yan , M. and Young , G. H. 1996 . Complexity of scheduling problems with generalized due dates . Journal of Combinatorial Mathematics and Combinatorial Computing , 22 : 51 – 63 .
   Google Scholar