The liquid crystal injection scheduling problem (LCISP)

References

• Castro , PM , Erdirik-Dogan , M and Grossmann , IE . 2008 . Simultaneous batching and scheduling of single stage batch plants with parallel units . American Institute of Chemical Engineers , 54 ( 1 ) : 183 – 193 .
   Google Scholar
• Castro , PM and Novais , AQ . 2008 . Short-term scheduling of multistage batch plants with unlimited intermediate storage . Industrial & Engineering Chemistry Research , 47 ( 16 ) : 6126 – 6139 .
   Google Scholar
• Castro , PM and Novais , AQ . 2009 . Scheduling multistage batch plants with sequence-dependent changeovers . American Institute of Chemical Engineers , 55 ( 8 ) : 2122 – 2137 .
   Web of Science ®Google Scholar
• Chung , SH , Tai , YT and Pearn , WL . 2009a . Minimizing makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes . International Journal of Production Research , 47 ( 18 ) : 5109 – 5128 .
   Web of Science ®Google Scholar
• Chung , SH , Pearn , WL and Tai , YT . 2009b . Fast and effective algorithms for the liquid crystal display module (LCM) scheduling problem with sequence dependent setup time . Journal of the Operational Research Society , 60 ( 7 ) : 921 – 933 .
   Web of Science ®Google Scholar
• Dobson , G and Nambimadom , RS . 2001 . The batch loading and scheduling problem . Operations Research , 49 ( 1 ) : 52 – 65 .
   Web of Science ®Google Scholar
• Erramilli , V and Mason , SJ . 2008 . Multiple orders per job batch scheduling with incompatible jobs . Annals of Operations Research , 159 ( 1 ) : 245 – 260 .
   Web of Science ®Google Scholar
• Golden , B . 1977 . Evaluate a sequential vehicle routing algorithm . AIIE Transactions , 9 ( 2 ) : 204 – 208 .
   Google Scholar
• Koh , SG . 2004 . Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families . International Journal of Production Research , 42 ( 19 ) : 4091 – 4107 .
   Web of Science ®Google Scholar
• Koh , SG . 2005 . Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families . International Journal of Production Economics , 98 ( 1 ) : 81 – 96 .
   Web of Science ®Google Scholar
• Kurz , ME and Mason , SJ . 2008 . Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times . International Journal of Production Research , 46 ( 1 ) : 131 – 151 .
   Web of Science ®Google Scholar
• Lee , CY and Uzsoy , R . 1999 . Minimizing makespan on a single batch processing machine with dynamic job arrivals . International Journal of Production Research , 37 ( 1 ) : 219 – 236 .
   Web of Science ®Google Scholar
• Malve , S and Uzsoy , R . 2007 . A genetic algorithm for minimizing maximum lateness in parallel identical batch processing machines with dynamic job arrivals and incompatible job families . Computer & Operations Research , 34 ( 10 ) : 3016 – 3028 .
   Web of Science ®Google Scholar
• Mehta , SV and Uzsoy , R . 1998 . Minimizing total tardiness on a batch processing machine with incompatible job families . IIE Transactions , 30 ( 2 ) : 165 – 178 .
   Web of Science ®Google Scholar
• Mönch , L . 2005 . Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times . Computers & Operations Research , 32 ( 11 ) : 2731 – 2750 .
   Web of Science ®Google Scholar
• Mönch , L , Zimmermann , J and Otto , P . 2006 . Machine learning techniques for scheduling jobs with incompatible families and unequal ready times on parallel batch machines . Engineering Applications of Artificial Intelligence , 19 ( 3 ) : 235 – 245 .
   Web of Science ®Google Scholar
• Pearn , WL , Chung , SH and Yang , MH . 2002 . Minimizing the total machine workload for the wafer probing scheduling problem . IIE Transactions , 34 ( 2 ) : 211 – 220 .
   Web of Science ®Google Scholar
• Pearn , WL , Chung , SH and Yang , MH . 2004 . Algorithms for the wafer probing scheduling problem with sequence-dependent set-up time and due date restrictions . Journal of the Operational Research Society , 55 ( 11 ) : 1194 – 1207 .
   Web of Science ®Google Scholar
• Perez , IC , Fowler , JW and Carlyle , WM . 2005 . Minimizing total weighted tardiness on a single batch process with incompatible job families . Computers & Operations research , 32 ( 2 ) : 327 – 341 .
   Web of Science ®Google Scholar
• Tangudu , SK and Kurz , ME . 2006 . A branch and bound algorithm to minimise total weighted tardiness on a single batch processing machine with ready times and incompatible job families . Production Planning and Control , 17 ( 7 ) : 728 – 741 .
   Web of Science ®Google Scholar
• Uzsoy , R . 1994 . Scheduling a single batch processing machine with non-identical job sizes . International Journal of Production Research , 32 ( 7 ) : 1615 – 1635 .
   Web of Science ®Google Scholar
• Uzsoy , R . 1995 . Scheduling batch processing machines with incompatible job families . International Journal of Production Research , 33 ( 10 ) : 2658 – 2708 .
   Web of Science ®Google Scholar