Learning effective dispatching rules for batch processor scheduling

International Journal of Production Research

Volumn 46, Issue 6, 2008, Pages 1431-1454

  Geiger, Christopher D ^a   Uzsoy, Reha ^b  

^a University of Central Florida   (United States)

^b SCHOOL OF INDUSTRIAL ENGINEERING   (United States)

Author keywords

AI in manufacturing systems; Batch scheduling; Dispatching rules; Genetic algorithms

Indexed keywords

AUTONOMOUS AGENTS; COMPUTATIONAL METHODS; GENETIC ALGORITHMS; LEARNING SYSTEMS; SCHEDULING;

BATCH SCHEDULING; DISPATCHING RULES;

INDUSTRIAL RESEARCH;

EID: 36348991068     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540600993360     Document Type: Article

References (36)

1. Ahmadi, J.H., Ahmadi, R.H., Sriram, D. and Tang, C.S., Batching and scheduling jobs on batch and discrete processors. Oper. Res., 1992, 39, 750-763.
2. Aho, A.V., Sethi, R. and Ullman, J.D., Compilers: Principles, Techniques and Tools, 1986 (Addison-Wesley: Reading, MA).
3. Avramidis, A.N., Healy, K.J. and Uzsoy, R., Control of a batch-processing machine: a computational approach. Int. J. Prod. Res., 1998, 36, 3167-3181.
4. Aytug, H., Bhattacharyya, S., Koehler, G.J. and Snowdon, J.L., A review of machine learning in scheduling. IEEE Trans. Engng Mgmt, 1994, 41, 165-171.
5. Azizoglu, M., and Webster, S., Scheduling a batch, processing machine with incompatible job families. Comput. Ind. Engng, 2001, 39, 325-335.
6. Banzhaf, W., Nordin, P., Keller, R.E. and Francone, F.D., Genetic Programming: An Introduction on the Automatic Evolution of Computer Programs and Its Applications, 1998 (Morgan Kaufman: San Francisco, CA).
7. Blackstone, J.H., Phillips, D.T. and Hogg, G.L., A state-of-the-art survey of dispatching rules for manufacturing job shop operations. Int. J. Prod. Res., 1982, 20, 27-45.
8. Blazewicz, J., Ecker, K.H., Pesch, E., Schmidt, G. and Weglarz, J., Scheduling Computer and Manufacturing Processes, 1996 (Springer: Heidelberg).
9. Brucker, P., Scheduling Algorithms, 1995 (Springer: Berlin).
10. Chandru, V., Lee, C.-Y. and Uzsoy, R., Minimizing total completion time on batch processing machines. Int. J. Prod. Res., 1993a, 31, 2097-2121.
11. Chandru, V., Lee, C.-Y. and Uzsoy, R., Minimizing total completion time on a batch processing machine with job families. Oper. Res. Lett., 1993b, 13, 61-65.
12. Chang, Y.-L., Sueyoshi, T. and Sullivan, R.S., Ranking dispatching rules by data envelopment analysis in a job shop environment. IIE Trans., 1996, 28, 631-642.
13. Chiu, C. and Yih, Y., A learning-based methodology for dynamic scheduling in distributed manufacturing systems. Int. J. Prod. Res., 1.995, 33, 3217-3232.
14. Fowler, J.W., Phillips, D.T. and Hogg, G.L., Real-time control of multiproduct bulkservice semiconductor manufacturing processes. IEEE Trans. Semicond. Mfg, 1992, 5, 158-163.
15. Geiger, C.D., Uzsoy, R. and Aytug, H., Rapid modeling and discovery of priority dispatching rules: an autonomous learning approach. J. Schedul., 2006, 9, 7-34.
16. Glassey, C.R. and Weng, W.W., Dynamic batching heuristic for simultaneous processing. IEEE Trans. Semicond. Mfg, 1991, 4, 77-82.
17. Ikura, Y. and Gimple, M., Scheduling algorithms for a single batch processing machine. Oper. Res. Lett., 1986, 5, 61-65.
18. Koza, J.R., Genetic Programming: On the Programming of Computers by Means of Natural Selection, 1992 (MIT Press: Cambridge, MA).
19. Lee, C.-Y., Piramuthu, S. and Tsai, Y.-K., Job shop scheduling with a genetic algorithm and machine learning. Int. J. Prod. Res., 1997, 35, 1171-1191.
20. Lee, C.-Y. and Uzsoy, R., Minimizing makespan on a single batch processing machine with dynamic job arrivals. Int. J. Prod. Res., 1999, 37, 219-236.
21. Lee, C.-Y., Uzsoy, R. and Martin-Vega, L.A., Efficient algorithms for scheduling semiconductor burn-in operations. Oper. Res., 1992, 40, 764-774.
22. Mehta, S.V. and Uzsoy, R., Minimizing total tardiness on a batch, processing machine with incompatible job families. IIE Trans., 1998, 30, 165-178.
23. Min, H.-S. and Yih, Y., Selection of dispatching rules on multiple dispatching decision points in real-time scheduling of a semiconductor wafer fabrication system. Int. J. Prod. Res., 2003, 41, 3921-3941.
24. Mitchell, T., Machine Learning, 1996 (McGraw-Hill: New York).
25. Monch, L., Balasubramanian, H., Fowler, J. and Pfund, M., Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness. Int. J. Prod. Res., 2004, 42, 1621-1638.
26. Perez, I.C., Fowler, J.W. and Carlyle, W.M., Minimizing total weighted tardiness on a single batch process machine with incompatible job families. Comput. Oper. Res., 2005, 32, 327-341.
27. Pierreval, H. and Mebarki, N., Dynamic selection of dispatching rules for manufacturing system scheduling. Int. J. Prod. Res., 1997, 35, 1575-1591.
28. Pinedo, M., Scheduling: Theory, Algorithms and Systems, 2002 (Prentice Hall: Englewood Cliffs, NJ).
29. Piramuthu, S., Raman, N. and Shaw, M.J., Learning-based scheduling in a flexible manufacturing flow line. IEEE Trans. Engng Mgmt, 1994, 41, 172-182.
30. Shaw, M.J., Park, S. and Raman, N., Intelligent scheduling with machine learning capabilities: the induction of scheduling knowledge. HE Trans., 1992, 24, 156-168.
31. Sung, C.C., Choung, Y.I., Hong, J.M. and Kim, Y., Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals. Comput. Oper. Res., 2002, 29, 2353-2373.
32. Uzsoy, R., Scheduling batch processing machines with incompatible job families. Int. J. Prod. Res., 1995, 33, 2685-2708.
33. Vepsalainen, A.P.J, and Morton, T.E., Priority rules for job shops with weighted tardiness costs. Mgmt Sci., 1.987, 33, 1035-1047.
34. Wang, C.S. and Uzsoy, R., A genetic algorithm to minimize maximum lateness on a batch processing machine. Comput. Oper. Res., 2002, 29, 1621-1640.
35. Webster, S. and Baker, K.R., Scheduling groups of jobs on a single machine. Oper. Res., 1995, 43, 692-703.
36. Weng, W.W. and Leachman, R.C., An improved methodology for real-time production decisions at batch-process work stations. IEEE Trans. Semicond. Mfg, 1993, 6, 219-225.