374
Views
40
CrossRef citations to date
0
Altmetric
Original Articles

The application of genetic algorithms to lot streaming in a job-shop scheduling problem

, &
Pages 3387-3412 | Received 01 Jul 2007, Published online: 23 Apr 2009

References

  • Adams , J , Balas , E and Zawack , D . 1988 . The shifting bottleneck procedure for job-shop scheduling . Management Science , 34 : 391 – 401 .
  • Chan , FTS , Wong , TC and Chan , LY . 2005 . A genetic algorithm-based approach to machine assignment problem . International Journal of Production Research , 43 : 2451 – 2472 .
  • Chang , JH and Chiu , HN . 2005 . A comprehensive review of lot streaming . International Journal of Production Research , 43 : 1515 – 1536 .
  • Cheng , R , Gen , M and Tsujimura , Y . 1999 . A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies . Computers & Industrial Engineering , 36 : 343 – 364 .
  • Croce , FD , Tadei , R and Volta , G . 1995 . A genetic algorithm for the job shop problem . Computers and Operations Research , 22 : 15 – 24 .
  • Dauzère-pérès , S and Lasserre , JB . 1997 . Lot streaming in job-shop scheduling . Operations Research , 45 : 584 – 595 .
  • Fisher , H and Thompson , GL . 1963 . “ Probabilistic learning combinations of local job-shop scheduling rules ” . In Industrial Scheduling. , Edited by: Muth , JF and Thompson , GL . Englewood Cliffs, NJ : Prentice Hall .
  • Hall , NG , Laporte , G , Selvarajah , E and Sriskandarajah , C . 2005 . Scheduling and lot streaming in two-machine open shops with no-wait in process . Naval Research Logistics , 52 : 261 – 275 .
  • Holland , JH . 1975 . Adaption in Natural and Artificial Systems , Ann Arbor, MI : The University of Michigan Press .
  • Jeong , HI , Park , J and Leachman , RC . 1999 . A batch splitting method for a job shop scheduling problem in an MRP environment . International Journal of Production Research , 37 : 3583 – 3598 .
  • Kalir , AA and Sarin , SC . 2001a . A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots . International Journal of Management Science , 29 : 577 – 584 .
  • Kalir , AA and Sarin , SC . 2001b . Optimal solutions for the single batch, flow shop, lot-streaming problem with equal Sublots . Decision Sciences , 32 : 387 – 397 .
  • Kim , SL and Ha , D . 2003 . A JIT lot-splitting model for supply chain management: enhancing buyer-supplier linkage . International Journal of Production Economics , 86 : 1 – 10 .
  • Kumar , S , Bagchi , TP and Sriskandarajah , C . 2000 . Lot streaming and scheduling heuristics for m-machine no-wait flowshops . Computers and Industrial Engineering , 38 : 149 – 172 .
  • Lawrence , S . 1984 . Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques, GSIA , Pittsburgh, PA : Carnegie Mellon University .
  • Ono , I , Yamamura , M and Kobayashi , S . 1996 . A genetic algorithm for job-shop scheduling problems using job-based order crossover . In: Proceedings of the International Conference on Evolutionary Computation . 1996 , Nayoya University, Japan. 20–22 May . pp. 547 – 552 .
  • Potts , CN and Van Wassenhove , LN . 1982 . A decomposition algorithm for the single machine total tardiness problem . Operations Research Letters , 1 : 177 – 181 .
  • Potts , CN and Baker , KR . 1989 . Flow shop scheduling with lot streaming . Operations Research Letters , 8 : 297 – 303 .
  • Reiter , S . 1966 . A system for managing job shop production . Journal of Business , 34 : 371 – 393 .
  • Şen , A and Benli , ÖS . 1999 . Lot streaming in open shops . Operations Research Letters , 23 : 135 – 142 .
  • Trietsch , D and Baker , KR . 1993 . Basic techniques for lot streaming . Operations Research , 6 : 1065 – 1076 .
  • Woo , S , Kang , S and Park , J . 1997 . A batch splitting heuristic for dynamic job shop scheduling problem . Computers and Industrial Engineering , 33 : 781 – 784 .
  • Yoon , SH and Ventura , JA . 2002 . An application of genetic algorithms to lot-streaming flow shop scheduling . IIE Transactions , 34 : 779 – 787 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.