Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes

References

• Ahmadi , JH , Ahmadi , RH , Dasu , S and Tang , CS . 1992 . Batching and scheduling jobs on batch and discrete processors . Oper. Res. , 40 : 750 – 763 .
   Web of Science ®Google Scholar
• Balasubramanian , H , Monch , L , 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
• Bean , JC . 1994 . Genetic algorithms and random keys for sequencing and optimization . ORSA J. Comput. , 6 : 154 – 160 .
   Google Scholar
• Brucker , P , Gladky , A , Hoogeveen , H , Kovalyov , MY , Potts , C , Tautenhahn , T and Van de Velde , S . 1998 . Scheduling a batching machine . J. Schedul. , 1 : 31 – 54 .
   Google Scholar
• Chandru , V , Lee , CY 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 , CY 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
• Coffman , EG , Garey , M and Johnson , DS . 1984 . “ Approximation algorithm for bin-packing problem an updated survey ” . In Algorithm Design for Computer System Design , Edited by: Ausiello , Y , Licertini , M and Serafini , P . 49 – 106 . NewYork, NY : Springer .
   Google Scholar
• Dobson , G and Nambimadom , RS . 1992 . The Batch Loading and Scheduling Problem. Research Report , Rochester, NY : Simon School of Business Administration, University of Rochester .
   Google Scholar
• Dupont , L and Dhaenens-Flipo , C . 2002 . Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure . Comput. Oper. Res. , 29 : 807 – 819 .
   Web of Science ®Google Scholar
• Dupont , L and Jolai Ghazvini , F . 1997a . “ An efficient heuristic for minimizing mean flow time on a single-batch-processing machine ” . In Proceeding of the 2nd International French-Quebec Conference on Industrial Engineering , Vol. no. 36 , France : Albi . paper
   Google Scholar
• Dupont , L and Jolai Ghazvini , F . 1997b . Branch-and-bound method for minimizing mean flow time on a single-batch-processing machine . Int. J. Ind. Eng. , 4 : 197 – 203 .
   Google Scholar
• Dupont , L and Jolai Ghazvini , F . 1998 . Minimizing makespan on a single-batch-processing machine with non-identical job sizes . Eur. J. Automat. Sys. , 32 : 431 – 440 .
   Google Scholar
• Gen , M and Cheng , R . 1997 . Genetic Algorithms and Engineering Design , 1 – 41 . New York, NY : Wiley .
   Google Scholar
• Hochbaum , DS and Landy , D . 1997 . Scheduling semiconductor burn-in operations to minimize total flow time . Oper. Res. , 45 : 874 – 885 .
   Web of Science ®Google Scholar
• Ikura , Y and Gimple , M . 1986 . Efficient scheduling algorithms for a single-batch-processing machine . Oper. Res. Lett. , 5 : 61 – 65 .
   Web of Science ®Google Scholar
• Jolai , F . 2005 . Minimizing number of tardy jobs on a batch-processing machine with incompatible job families . Eur. J. Oper. Res. , 162 : 184 – 190 .
   Web of Science ®Google Scholar
• Jolai Ghazvini , F and Dupont , L . 1998 . Minimizing mean flow time on a single-batch-processing machine with non-identical job sizes . Int. J. Prod. Econ. , 55 : 273 – 280 .
   Web of Science ®Google Scholar
• Kempf , KG , Uzsoy , R and Wang , CS . 1998 . Scheduling a single-batch-processing machine with secondary resource constraints . J. Manuf. Sys. , 17 : 37 – 51 .
   Web of Science ®Google Scholar
• Koh , SG , Koo , PH , Kim , DC and Hur , WS . 2005 . Scheduling a single-batch-processing machine with arbitrary job sizes and incompatible job families . Int. J. Prod. Econ. , 98 : 81 – 96 .
   Web of Science ®Google Scholar
• Lee , CY 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 , CY , Uzsoy , R and Martin-Vega , LA . 1992 . Efficient algorithms for scheduling semiconductor burn-in operations . Oper. Res. , 40 : 764 – 775 .
   Web of Science ®Google Scholar
• Li , CL and Lee , CY . 1997 . Scheduling with agreeable release times and due dates on a batch-processing machine . Eur. J. Oper. Res. , 96 : 564 – 569 .
   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. Schedul. Logist. , 30 : 165 – 178 .
   Web of Science ®Google Scholar
• Melouk , S , Damodaran , P and Chang , PY . 2004 . Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing . Int. J. Prod. Econ. , 87 : 141 – 147 .
   Web of Science ®Google Scholar
• Monch , L , Balasubramanian , H , Fowler , J and Pfund , M . 2005 . Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times . Comput. Oper. Res. , 32 : 2731 – 2750 .
   Web of Science ®Google Scholar
• Shuguang , L , Guojun , L , Xiaoli , W and Qiming , L . 2005 . Minimizing makespan on a single batching machine with release times and non-identical job sizes . Oper. Res. Lett. , 33 : 157 – 164 .
   Web of Science ®Google Scholar
• Uzsoy , R . 1994 . A single-batch-processing machine with non-identical job sizes . Int. J. Prod. Res. , 32 : 1615 – 1635 .
   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
• Uzsoy , R and Yang , Y . 1997 . Minimizing total weighted completion time on a single-batch-processing machine . Prod. Oper. Manag. , 6 : 57 – 73 .
   Google Scholar
• Wang , C 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