Minimising makespan on a single batch processing machine with dynamic job arrivals and non-identical job sizes

References

• Brucker, P., A. Gladky, H. Hoogeveen, M. Y. Kovalyov, C. N. Potts, T. Tautenhahn, and S. L. Van De Velde. 1998. “Scheduling a Batching Machine.” Journal of Scheduling 1 (1): 31–54.
   Google Scholar
• Chandru, V., C. Y. Lee, and R. Uzsoy. 1993. “Minimizing Total Completion Time on Batch Processing Machines.” International Journal of Production Research 31 (9): 2097–2121.
   Web of Science ®Google Scholar
• Chen, H., B. Du, and G. 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.
   Web of Science ®Google Scholar
• Chou, F. D., P. C. Chang, and H. M. Wang. 2006. “A Hybrid Genetic Algorithm to Minimize Makespan for the Single Batch Machine Dynamic Scheduling Problem.” International Journal of Advanced Manufacturing Technology 31 (3–4): 350–359.
   Web of Science ®Google Scholar
• Chou, F. D. 2007. “A Joint GA+DP Approach for Single Burn-in Oven Scheduling Problems with Makespan Criterion.” International Journal of Advanced Manufacturing Technology 35 (5): 587–595.
   Web of Science ®Google Scholar
• Damodaran, P., P. K. Manjeshwar, and K. Srihari. 2006. “Minimizing Makespan on a Batch-processing Machine with Non-identical Job Sizes Using Genetic Algorithms.” International Journal of Production Economics 103 (2): 882–891.
   Web of Science ®Google Scholar
• Deng, X. T., H. D. Feng, G. J. Li, and B. Y. Shi. 2005. “A PTAS for Semiconductor Burn-in Scheduling.” Journal of Combinatorial Optimization 9 (1): 1–13.
   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
• Ghazvini, F. J., and L. Dupont. 1998. “Minimizing Mean Flow Times Criteria on a Single Batch Processing Machine with Non-identical Jobs Sizes.” International Journal of Production Economics 55 (3): 273–280.
   Web of Science ®Google Scholar
• Graham, R.L., E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey.” Annals of Discrete Mathematics 5 (2): 287–326.
   Google Scholar
• Ikura, Y., and M. Gimple. 1986. “Efficient Scheduling Algorithms for a Single Batch Processing Machine.” Operations Research Letters 5 (2): 61–65.
   Web of Science ®Google Scholar
• Kashan, A. H., and B. Karimi. 2008. “Scheduling a Single Batch-processing Machine with Arbitrary Job Sizes and Incompatible Job Families: An Ant Colony Framework.” Journal of the Operational Research Society 59 (9): 1269–1280.
   Web of Science ®Google Scholar
• Kashan, A. H., B. Karimi, and F. Jolai. 2006. “Effective Hybrid Genetic Algorithm for Minimizing Makespan on a Single-batch-processing Machine with Non-identical Job Sizes.” International Journal of Production Research 44 (12): 2337–2360.
   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.
   Web of Science ®Google Scholar
• Lee, C. Y., R. Uzsoy, and L. A. Martinvega. 1992. “Efficient Algorithms for Scheduling Semiconductor Burn-in Operations.” Operations Research 40 (4): 764–775.
   Web of Science ®Google Scholar
• Li, C. L., and C. Y. Lee. 1997. “Scheduling with Agreeable Release Times and Due Dates on a Batch Processing Machine.” European Journal of Operational Research 96 (3): 564–569.
   Web of Science ®Google Scholar
• Li, S. G., G. J. Li, X. L. Wang, and Q. M. Liu. 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
• 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.
   Web of Science ®Google Scholar
• Sung, C., and Y. Choung. 2000. “Minimizing Makespan on a Single Burn-in Oven in Semiconductor Manufacturing.” European Journal of Operational Research 120 (3): 559–574.
   Web of Science ®Google Scholar
• Sung, C.S., Y. I. Choung, J. M. Hong, and Y. H. Kim. 2002. “Minimizing Makespan on a Single Burn-in Oven with Job Families and Dynamic Job Arrivals.” Computers & Operations Research 29 (8): 995–1007.
   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
• Wang, C. S., and R. Uzsoy. 2002. “A Genetic Algorithm to Minimize Maximum Lateness on a Batch Processing Machine.” Computers & Operations Research 29 (12): 1621–1640.
   Web of Science ®Google Scholar
• Xu, R., H. Chen, and X. Li. 2012. “Makespan Minimization on Single Batch-processing Machine Via Ant Colony Optimization.” Computers & Operations Research 39 (3): 582–593.
   Web of Science ®Google Scholar
• Zhang, G. C., X. Q. Cai, C. Y. Lee, and C. K. Wong. 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