Lot streaming technique in job-shop environment

Proceedings of the 20th IEEE International Symposium on Intelligent Control, ISIC '05 and the 13th Mediterranean Conference on Control and Automation, MED '05

Volumn 2005, Issue , 2005, Pages 364-369

  Chan, Felix T S ^a   Wong, T C ^a   Chan, Philip L Y ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; GENETIC ALGORITHMS; JOB ANALYSIS; JUST IN TIME PRODUCTION; MATHEMATICAL MODELS; PROBLEM SOLVING;

JOB-SHOP SCHEDULING PROBLEM (JSP); LOT STREAMING (LS);

MACHINE SHOPS;

EID: 33745196939     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/.2005.1467042     Document Type: Conference Paper

References (15)

1. 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.
2. Jeong H. I., Park J. and Leachman R. C., 1999, A batch splitting method for a job shop scheduling problem in an MRP environment. International Journal of Production Research, 37, 3583-3598.
3. Kalir A. A. and Sarin S. C., 2001, 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.
4. Kumar S., Bagchi T. P. and Sriskandarajah C., 2000, Lot streaming and scheduling heuristics for m-machine no-wait flowshops. Computers and Industrial Engineering, 38, 149-172.
5. Yoon S. H. and Ventura J. A., 2002, An application of genetic algorithms to lot-streaming flow shop scheduling. HE Transactions, 34, 779-787.
6. Şen A. and Benli Ö. S., 1999, Lot streaming in open shops. Operations Research Letters, 23, 135-142.
7. Trietsch D. and Baker K. R., 1993, Basic techniques for lot streaming. Operations Research, 6, 1065-1076.
8. Dauzère-pérès S. and Lasserre J. B., 1997, Lot streaming in job-shop scheduling. Operations Research, 45, 584-595.
9. Holland J. H., 1975, Adaption in natural and artificial systems. The University of Michigan Press, Ann Arbor.
10. 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.
11. Croce F. D., Tadei R. and Volta G., 1995, A genetic algorithm for the job shop problem. Computers and Operations Research, 22, 15-24.
12. Ono I., Yamamura M. and Kobayashi S., 1996, A genetic algorithm for job-shop scheduling problems using job-based order crossover. Proceedings of International Conference on Evolutionary Computation 1996, 547-552.
13. Kim S. L. 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.
14. Potts C. N. and Van Wassenhove L. N., 1982, A decomposition algorithm for the single machine total tardiness problem. Operations Research Letters, 1, 177-181.
15. Potts C. N. and Baker K. R., 1989, Flow shop scheduling with lot streaming. Operations Research Letters, 8, 297-303.