A genetic algorithm for scheduling parallel non-identical batch processing machines

Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007

Volumn , Issue , 2007, Pages 143-150

  Shubin, Xu ^a,b   Bean, James C ^b  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b UNIVERSITY OF OREGON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BATCH DATA PROCESSING; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; INTEGER PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING; SCHEDULING;

MATHEMATICAL PROGRAMMING SOFTWARE; PARALLEL NON IDENTICAL BATCH PROCESSING;

GENETIC ALGORITHMS;

EID: 34548769981     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SCIS.2007.367682     Document Type: Conference Paper

References (36)

1. R. Uzsoy, C. Y. Lee, and L. A. Martin-Vega, "A review of production planning and scheduling models in the semiconductor industry Part I: System characteristics, performance evaluation and production planning," HE Trans., vol. 24, pp. 47-60, 1992.
2. C. Y. Lee, R. Uzsoy, and L. A. Martin-Vega, "Efficient algorithms for scheduling semiconductor burn-in operations," Oper. Res., vol. 40, pp. 764-775, 1992.
3. R. Uzsoy, "Scheduling batch processing machines with incompatible job families," Int. J. Prod. Res., vol. 33, pp. 2685-2708, 1995.
4. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, "Optimization and approximation in deterministic sequencing and scheduling: A survey," Ann. Discrete Math., vol. 5, pp. 287-326, 1979.
5. R. Uzsoy, "Scheduling a single batch processing machine with nonidentical job sizes," Int. J. Prod. Res., vol. 32, pp. 1615-1635, 1994.
6. Y. Ikura and M. Gimple, "Efficient scheduling algorithms for a single batch processing machine," Oper. Res. Lett., vol. 5, pp. 61-65, 1986.
7. C. N. Potts and M. Y. Kovalyov, "Scheduling with batching: a review," Eur. J. Oper. Res., vol. 120, pp. 228-249, 2000.
8. V. Chandra, C. Y. Lee, and R. Uzsoy, "Minimizing total completion time on batch processing machines," Int. J. Prod Res., vol. 31, pp. 2097-2121, 1993.
9. _, "Minimizing total completion time on a batch processing machine with job families," Oper. Res. Lett., vol. 13, pp. 61-65, 1993.
10. S. V. Mehta and R. Uzsoy, "Minimizing total tardiness on a batch processing machine with incompatible job families," HE Trans., vol. 30, pp. 165-178, 1998.
11. C. Y. Lee and R. Uzsoy, "Minimizing makespan on a single batch processing machine with dynamic job arrivals," Int. J. Prod. Res., vol. 37, pp. 219-236, 1999.
12. C. S. Sung and Y. I. Choung, "Minimizing makespan on a single burn-in oven in semiconductor manufacturing," Eur. J. Oper. Res., vol. 120, pp. 559-574, 2000.
13. P. Y. Chang, P. Damodaran, and S. Melouk, "Minimizing makespan on parallel batch processing machines," Int. J. Prod. Res., vol. 42, pp. 4211-4220, 2004.
14. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley, 1989.
15. D. Dasgupta and Z. Michalewicz, "Evolutionary algorithms -an overview," in Evolutionary Algorithms in Engineering Applications, D. Dasgupta and Z. Michalewicz, Eds. Berlin, Germany: Springer-Verlag, 1997.
16. R. Cheng, M. Gen, and Y. Tsujimura, "A tutorial survey of job-shop scheduling problems using genetic algorithms, part I: Representation," Comput. Ind. Eng., vol. 30, pp. 983-997, 1996.
17. _, "A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: Hybrid genetic search strategies," Comput. Ind. Eng., vol. 36, pp. 343-364, 1999.
18. C. R. Reeves, "Genetic algorithms for the operations researcher," INFORMS J. Comput., vol. 9, pp. 231-250, 1997.
19. A. S. Jain and S. Meeran, "Deterministic job-shop scheduling: Past, present and future," Eur. J. Oper. Res., vol. 113, pp. 390-434, 1999.
20. C. Dimopoulos and A. M. S. Zalzala, "Recent developments in evolutionary computation for manufacturing optimization: Problems, solutions, and comparisons," IEEE Trans. Evol. Comput., vol. 4, pp. 93-113, July 2000.
21. H. Aytug, M. Khouja, and F. E. Vergara, "Use of genetic algorithms to solve production and operations management problems: a review," Int. J. Prod. Res., vol. 41, pp. 3955-4009, 2003.
22. C. S. Wang and R. Uzsoy, "A genetic alogrithm to minimize maximize lateness on a batch processing machine," Comput. Oper. Res., vol. 29, pp. 1621-1640, 2002.
23. S. G. Koh, P. H. Koo, J. W. Ha, and W. S. Lee, "Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families," Int. J. Prod. Res., vol. 42, pp. 4091-4107, 2004.
24. S. G. Koh, P. H. Koo, D. C. Kim, and W. S. Hur, "Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families," Int. J. Prod. Econ., vol. 98, pp. 81-96, 2005.
25. P. Damodaran, P. K. Manjeshwar, and K. Srihari, "Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms," Int. J. Prod. Econ., vol. 103, pp. 882-891, 2006.
26. H. Balasubramanian, L. Mönch, J. Fowler, and M. Pfund, "Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness," Int. J. Prod. Res., vol. 42, pp. 1621-1638, 2004.
27. L. Mönch, H. Balasubramanian, J. W. Fowler, and M. E. Pfund, "Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times," Comput. Oper. Res., vol. 32, pp. 2731-2750, 2005.
28. J. C. Bean, "Genetic algorithms and random keys for sequencing and optimization," ORSA J. Comput., vol. 6, pp. 154-160, 1994.
29. B. A. Norman and J. C. Bean, "Random keys genetic algorithm for job shop scheduling," Eng. Des. Autom., vol. 3, pp. 145-156, 1997.
30. _, "A genetic algorithm methodology for complex scheduling problems," Nav. Res. Logist., vol. 46, pp. 199-211, 1999.
31. _, "Scheduling operations on parallel machine tools," HE Trans., vol. 32, pp. 449-459, 2000.
32. M. E. Kurz and R. G. Askin, "Scheduling flexible flow lines with sequence-dependent setup times," Eur. J. Oper. Res., vol. 159, pp. 66-82, 2004.
33. J. F. Gonçalves, J. J. de Magalhães Mendes, and M. G. C. Resende, "A hybrid genetic algorithm for the job shop scheduling problem," Eur. J. Oper. Res., vol. 167, pp. 77-95, 2005.
34. L. Snyder and M. Daskin, "A random-key genetic algorithm for the generalized traveling salesman problem," Eur. J. Oper. Res., vol. 174, pp. 38-53, 2006.
35. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, 3rd ed. New York, NY: Springer-Verlag, 1996.
36. W. M. Spears and K. A. De Jong, "On the virtues of parameterized uniform crossover," in Proc. Fourth Int. Conf. Genetic Algorithms, San Diego, CA, July 13-16, 1991, pp. 230-236.