Makespan minimisation on parallel batch processing machines with non-identical job sizes and release dates

References

• Azizoglu , M and Webster , S . 2000 . Scheduling a batch processing machine with non-identical job sizes . International Journal of Production Research , 38 ( 10 ) : 2173 – 2184 .
   Web of Science ®Google Scholar
• Azizoglu , M and Webster , S . 2001 . Scheduling a batch processing machine with incompatible job families . Computers and Industrial Engineering , 39 ( 3/4 ) : 325 – 335 .
   Web of Science ®Google Scholar
• Chang , Y , Damodaran , P and Melouk , S . 2004 . Minimizing makespan on parallel batch processing machines . International Journal of Production Research , 42 ( 19 ) : 4211 – 4220 .
   Web of Science ®Google Scholar
• Chen , H , Du , B and Huang , GQ . 2010 . Metaheuristics to minimise makespan on parallel batch processing machines with dynamic job arrivals . International Journal of Computer Integrated Manufacturing , 23 ( 10 ) : 942 – 956 .
   Web of Science ®Google Scholar
• Chung , SH , Tai , YT and Pearn , WL . 2009 . 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
• Coffman , EG Jr , Garey , MR and Johnson , DS . 1987 . Bin packing with divisible item sizes . Journal of Complexity , 3 ( 4 ) : 406 – 428 .
   Google Scholar
• Coffman , EG Jr , Garey , MR and Johnson , DS . 1997 . “ Approximation algorithms for bin packing: a survey ” . In Approximation algorithms for NP-hard problems , Edited by: Hochbaum , D . 46 – 93 . Boston : PWS Publishing .
   Google Scholar
• Damodaran , P and Velez Gallego , MC . 2010 . Heuristics for makespan minimization on parallel batch processing machines with unequal job ready times . International Journal of Advanced Manufacturing Technology , 49 ( 9–12 ) : 1119 – 1128 .
   Web of Science ®Google Scholar
• Damodaran , P , Velez-Gallego , MC and Maya , J . 2011 . A GRASP approach for makespan minimization on parallel batch processing machines . Journal of Intelligent Manufacturing , 22 ( 5 ) : 767 – 777 .
   Web of Science ®Google Scholar
• Dupont , L and Jolai Ghazvini , F . 1998 . Minimizing makespan on a single batch processing machine with non-identical job sizes . European Journal of Automation , 32 ( 4 ) : 431 – 440 .
   Google Scholar
• Dupont , L and Dhaenens-Flipo , C . 2002 . Minimizing the makespan on a batch processing machine with non-identical job sizes: an exact procedure . Computers and Operations Research , 29 ( 7 ) : 807 – 819 .
   Web of Science ®Google Scholar
• Feo , T and Resende , MGC . 1989 . A probabilistic heuristic for a computationally difficult set covering problem . Operations Research Letters , 8 ( 2 ) : 67 – 71 .
   Web of Science ®Google Scholar
• Graham , R . 1979 . Optimization and approximation in deterministic sequencing and scheduling: a survey . Annals of Discrete Mathematics , 5 : 287 – 326 .
   Google Scholar
• Ikura , Y and Gimple , M . 1986 . Efficient scheduling algorithms for a single batch processing machine . Operations Research Letters , 5 : 61 – 65 .
   Web of Science ®Google Scholar
• Jolai Ghazvini , F and Dupont , L . 1998 . Minimizing mean flow times criteria on a single batch processing machine with non-identical job sizes . International Journal of Production Economics , 55 ( 3 ) : 273 – 280 .
   Web of Science ®Google Scholar
• Kashan , AH , Karimi , B and Jolai , F . 2006 . Minimizing makespan on a single batch processing machine with non-identical job sizes: A hybrid genetic approach . EvoCOP'2006 , : 135 – 146 .
   Google Scholar
• Kashan , AH , Karimi , B and Jenabi , M . 2008 . A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes . Computers and Operations Research , 35 ( 4 ) : 1084 – 1098 .
   Web of Science ®Google Scholar
• Kashan , AH , Karimi , B and Fatemi Ghomi , STM . 2009 . A note on minimizing makespan on a single batch processing machine with nonidentical job sizes . Theoretical Computer Science , 410 ( 27–29 ) : 2754 – 2758 .
   Web of Science ®Google Scholar
• Kashan , AH , Karimi , B and Jolai , F . 2010 . An effective hybrid multi-objective genetic algorithm for bi-criteria scheduling on a single batch processing machine with nonidentical job sizes . Engineering Applications of Artificial Intelligence , 23 ( 6 ) : 911 – 922 .
   Web of Science ®Google Scholar
• Kempf , KG , Uzsoy , R and Wang , C . 1998 . Scheduling a single batch processing machine with secondary resource constraints . Journal of Manufacturing Systems , 17 ( 1 ) : 37 – 51 .
   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
• Li , S . 2005 . Minimizing makespan on a single batching machine with release times and non-identical job sizes . Operations Research Letters , 33 ( 2 ) : 157 – 164 .
   Web of Science ®Google Scholar
• Lu , S , Feng , H and Li , X . 2010 . Minimizing the makespan on a single parallel batching machine . Theoretical Computer Science , 411 ( 7–9 ) : 1140 – 1145 .
   Web of Science ®Google Scholar
• Martello , S and Toth , P . 1990 . Knapsack problems: Algorithms and computer implementations , New York : Wiley .
   Google Scholar
• Melouk , S , Damodaran , P and Chang , P . 2004 . Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing . International Journal of Production Economics , 87 ( 2 ) : 141 – 147 .
   Web of Science ®Google Scholar
• Neale , JJ and Duenyas , I . 2003 . Control of a batch processing machine serving compatible job families . IIE Transactions , 38 ( 8 ) : 699 – 710 .
   Web of Science ®Google Scholar
• Ngo Cong , K . 2009 . “ Etude et amelioration de l'organisation de la production de dispositifs medicaux steriles ” . In Thesis (PhD) , Universite Joseph Fourrier .
   Google Scholar
• Nong , QQ , Ng , CT and Cheng , TCE . 2008 . The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan . Operations Research Letters , 36 ( 1 ) : 61 – 66 .
   Web of Science ®Google Scholar
• Parsa , NR . 2010 . A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes . Computers and Operations Research , 37 ( 10 ) : 1720 – 1730 .
   Web of Science ®Google Scholar
• Potts , CN and Kovalyov , MY . 2000 . Scheduling with batching: a review . European Journal of Operational Research , 120 ( 2 ) : 228 – 249 .
   Web of Science ®Google Scholar
• Standard , AFNOR . FD S98-135. Sterilisation des dispositifs medicaux. Guide pour la maitrise des traitements appliques aux dispositifs medicaux reutilisables
   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
• Wang , H and Chou , F-D . 2010 . Solving the parallel batch-processing machines with different release times, job sizes, and capacity limits by metaheuristics . Expert Systems with Applications: an International Journal , 37 ( 2 ) : 1510 – 1521 .
   Web of Science ®Google Scholar
• Zhang , G . 2001 . Minimizing makespan on a single batch processing machine with nonidentical job sizes . Naval Research Logistics , 48 ( 3 ) : 226 – 240 .
   Web of Science ®Google Scholar
• Zhang , X . 2007 . Approximation schemes for scheduling a batching machine with nonidentical job size . Journal of Systems Science and Complexity , 20 ( 4 ) : 592 – 600 .
   Web of Science ®Google Scholar