Minimising makespan on a batch processing machine using heuristics improved by an enumeration scheme

References

• Chandru, V., C. Y. Lee, and R. Uzsoy. 1993a. “Minimizing Total Completion Time on a Batch Processing Machine with Job Families.” Operations Research Letters 13 (2): 61–65. doi:10.1016/0167-6377(93)90030-k.
   Web of Science ®Google Scholar
• Chandru, V., C. Y. Lee, and R. Uzsoy. 1993b. “Minimizing Total Completion Time on Batch Processing Machines.” International Journal of Production Research 31 (9): 2097–2121.10.1080/00207549308956847
   Web of Science ®Google Scholar
• Chen, H., B. Du, and George Q. Huang. 2011. “Scheduling a Batch Processing Machine with Non-Identical Job Sizes: A Clustering Perspective.” International Journal of Production Research 49 (19): 5755–5778. doi:10.1080/00207543.2010.512620.
   Web of Science ®Google Scholar
• Cheng, B. Y., S. L. Yang, X. X. Hu, and B. Chen. 2012. “Minimizing Makespan and Total Completion Time for Parallel Batch Processing Machines with Non-identical Job Sizes.” Applied Mathematical Modelling 36 (7): 3155–3161. doi:10.1016/j.apm.2011.09.061.
   Web of Science ®Google Scholar
• Dauzere-Peres, Stephane, and Lars Moench. 2013. “Scheduling Jobs on a Single Batch Processing Machine with Incompatible Job Families and Weighted Number of Tardy Jobs Objective.” Computers & Operations Research 40 (5): 1224–1233. doi:10.1016/j.cor.2012.12.012.
   Web of Science ®Google Scholar
• Dupont, L., and C. Dhaenens-Flipo. 2002. “Minimizing the Makespan on a Batch Machine with Non-Identical Job Sizes: An Exact Procedure.” Computers & Operations Research 29 (7): 807–819.
   Web of Science ®Google Scholar
• Dupont, L., and F. J. Ghazvini. 1998. “Minimizing Makespan on a Single Batch Processing Machine with Non-Identical Job Sizes.” APII-JESA Journal Europeen Des Systemes Automatises 32 (4): 431–440.
   Google Scholar
• Garey, M. R., and D. S. Johnson. 1979a. Computers and Intractability. A Guide to the Theory of Np-completeness. San Francisco: W. H. Freeman.
   Google Scholar
• Garey, Michael R., and David S. Johnson. 1979b. Computers and Intractability : A Guide to the Theory of Np-completeness, A Series of Books in the Mathematical Sciences. San Francisco: W. H. Freeman.
   Google Scholar
• Ikura, Y., and M. Gimple. 1986. “Efficient Scheduling Algorithms for a Single Batch Processing Machine.” Operations Research Letters 5 (2): 61–65.10.1016/0167-6377(86)90104-5
   Web of Science ®Google Scholar
• Johnson, D. S. 1973. “Near-optimal Bin Packing Algorithms.” PhD., Massachusetts Institute of Technology.
   Google Scholar
• Johnson, D. S., A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham. 1974. “Worst-case Performance Bounds for Simple One-dimensional Packing Algorithms.” SIAM Journal on Computing 3 (4): 299–325.10.1137/0203025
   Google Scholar
• Johnson, D. S., E. G. Coffman, and M. R. Garey. 1997. “Approximation Algorithms for Bin Packing: A Survey.” In Approximation Algorithms for NP-Hard Problems, edited by Hochbaum D[Z], 46–93. Boston: PWS Publishing.
   Google Scholar
• Kashan, A. H., B. Karimi, and F. Jolai. 2006. “Minimizing Makespan on a Single Batch Processing Machine with Non-identical Job Sizes: A Hybrid Genetic Approach.” Evolutionary Computation in Combinatorial Optimization, Proceedings 3906: 135–146.10.1007/11730095
   Web of Science ®Google Scholar
• Kashan, A. H., M. H. Kashan, and S. Karimiyan. 2013. “A Particle Swarm Optimizer for Grouping Problems.” Information Sciences 252: 81–95. doi:10.1016/j.ins.2012.10.036.
   Web of Science ®Google Scholar
• Lee, C. Y., and R. Uzsoy. 1999. “Minimizing Makespan on a Single Batch Processing Machine with Dynamic Job Arrivals.” International Journal of Production Research 37 (1): 219–236.10.1080/002075499192020
   Web of Science ®Google Scholar
• Lee, C. Y., R. Uzsoy, and L. A. Martin-Vega. 1992. “Efficient Algorithms for Scheduling Semiconductor Burn-in Operations.” Operations Research 40 (4): 764–775.10.1287/opre.40.4.764
   Web of Science ®Google Scholar
• Melouk, S., P. Damodaran, and P. Y. Chang. 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. doi:10.1016/s0925-5273(03)00092-6.
   Web of Science ®Google Scholar
• Mosheiov, G., D. Oron, and Y. Ritov. 2004. “Flow-shop Batch Scheduling with Identical Processing-time Jobs.” Naval Research Logistics 51 (6): 783–799. doi:10.1002/nav.20028.
   Web of Science ®Google Scholar
• Ozturk, Onur, Marie-Laure Espinouse, Maria Di Mascolo, and Alexia Gouin. 2012. “Makespan Minimisation on Parallel Batch Processing Machines with Non-Identical Job Sizes and Release Dates.” International Journal of Production Research 50 (20): 6022–6035. doi:10.1080/00207543.2011.641358.
   Web of Science ®Google Scholar
• Tang, K., P. Yang, and X. Yao. 2016. “Negatively Correlated Search.” IEEE Journal on Selected Areas in Communications 34 (3): 1–9.
   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.10.1080/00207549408957026
   Web of Science ®Google Scholar
• Uzsoy, R. 1995. “Scheduling Batch Processing Machines with Incompatible Job Families.” International Journal of Production Research 33 (10): 2685–2708. doi:10.1080/00207549508904839.
   Web of Science ®Google Scholar
• Wang, J., and Joseph Y. T. Leung. 2014. “Scheduling Jobs with Equal-processing-time on Parallel Machines with Non-identical Capacities to Minimize Makespan.” International Journal of Production Economics 156: 325–331. doi:10.1016/j.ijpe.2014.06.019.
   Web of Science ®Google Scholar
• Xu, R., H. P. Chen, X. P. Li. 2012. “Makespan Minimization for Single Batch Processing Machine via Ant Colony Optimization”. Computers & Operations Research  39 (3): 582–593.
   Web of Science ®Google Scholar
• Xu, R., H. P. Chen, and X. P. Li. 2013. “A Bi-objective Scheduling Problem on Batch Machines via a Pareto-based Ant Colony System.” International Journal of Production Economics 145 (1): 371–386. doi:10.1016/j.ijpe.2013.04.053.
   Web of Science ®Google Scholar
• Xu, R., H. P. Chen, X. L. Liang, and H. M. Wang. 2016. “Priority-based Constructive Algorithms for Scheduling Agile Earth Observation Satellites With Total Priority Maximization”. Expert Systems with Applications 51: 195–206.
   Web of Science ®Google Scholar