Learning effective dispatching rules for batch processor scheduling

References

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