Lot splitting under different job shop conditions

2007 IEEE Congress on Evolutionary Computation, CEC 2007

Volumn , Issue , 2007, Pages 4722-4728

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

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

JOB SHOP CONDITIONS; LOT SPLITTING; SETUP TIME; SYSTEM CONGESTION INDEX;

PROBLEM SOLVING; SYSTEMS ANALYSIS;

EVOLUTIONARY ALGORITHMS;

EID: 77951473961     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2007.4425091     Document Type: Conference Paper

References (18)

1. S. Reiter, "A system for managing job shop production," Journal of Business, vol. 34, pp. 371-393, 1966.
2. D. Trietsch and K. R. Baker, "Basic techniques for lot streaming," Operations Research, vol. 6, pp. 1065-1076, 1993.
3. A. A. Kalir and S. C. Sarin, "A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots," International Journal of Management Science, vol. 29, pp. 577-584, 2001.
4. A. A. Kalir and S. C. Sarin, "Optimal solutions for the single batch, flow shop, lot-streaming problem with equal sublots," Decision Sciences, vol. 32, pp. 387-397.
5. S. Kumar, T. P. Bagchi, and C. Sriskandarajah, "Lot streaming and scheduling heuristics for m-machine no-wait flowshops," Computers and Industrial Engineering, vol. 38, pp. 149-172, 2000.
6. S. H. Yoon and J. A. Ventura, "An application of genetic algorithms to lot-streaming flow shop scheduling," IIE Transactions, vol. 34, pp. 779-787, 2002.
7. A. Şen and Ö. S. Benli, "Lot streaming in open shops," Operations Research Letters, vol. 23, pp. 135-142, 1999.
8. N. G. Hall, G. Laporte, E. Selvarajah, and C. Sriskandarajah, "Scheduling and lot streaming in two-machine open shops with no-wait in process," Naval Research Logistics, vol. 52, pp. 261-275, 2005.
9. S. Dauzère-pérès and J. B. Lasserre, "Lot streaming in job-shop scheduling," Operations Research, vol. 45, pp. 584-595, 1997.
10. H. I. Jeong, J. Park, and R. C. Leachman, "A batch splitting method for a job shop scheduling problem in an MRP environment," International Journal of Production Research, vol. 37, pp. 3583-3598, 1999.
11. F. T. S. Chan, T. C. Wong, and L. Y. Chan, "A genetic algorithm-based approach to machine assignment problem," International Journal of Production Research, vol. 43, no. 12, pp. 2451-2472, 2005.
12. J. H. Holland, Adaption in Natural and Artificial Systems. The University of Michigan Press: Ann Arbor, 1975.
13. I. Ono, M. Yamamura, and S. Kobayashi, "A genetic algorithm for job-shop scheduling problems using job-based order crossover," in Proceedings of International Conference on Evolutionary Computation, Japan, 1996, pp. 547-552.
14. J. Adams, E. Balas and D. Zawack, "The shifting bottleneck procedure for job-shop scheduling," Management Science, vol. 34, pp. 391-401, 1988.
15. F. D. Croce, R. Tadei and G. Volta, "A genetic algorithm for the job shop problem," Computers and Operations Research, vol. 22, pp. 15-24, 1995.
16. H. Fishers and G. L. Thompson, Probabilistic learning combinations of local job-shop scheduling rules. Prentice Hall: Englewood Cliffs, NJ, 1963.
17. S. Lawrence, Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Carnegie Mellon University: Pittsburgh, Pennsylvania, 1984.
18. C. N. Potts and L. N. Van Wassenhove, "A decomposition algorithm for the single machine total tardiness problem," Operations Research Letters, vol. 1, pp. 177-181, 1982.