Decomposition heuristics for parallel-machine multiple orders per job scheduling problems with a common due date

References

• Agrawal, G. K., & Heragu, S. S. (2006). A survey of automated material handling systems in 300-mm semiconductor fabs. IEEE Transactions on Semiconductor Manufacturing, 19(1), 112–120. doi: 10.1109/TSM.2005.863217
   Web of Science ®Google Scholar
• Azizoglu, M., & Webster, S. (1997). Scheduling job families about an unrestricted common due date on a single machine. International Journal of Production Research, 35(5), 1321–1330. doi: 10.1080/002075497195344
   Web of Science ®Google Scholar
• Bean, J. C. (1994). Genetic algorithm and random keys for sequencing and optimization. ORSA Journal of Computing, 6(2), 154–160. doi: 10.1287/ijoc.6.2.154
   Google Scholar
• brkgaAPI (2018). Brkga source code. Retrieved from https://github.com/rfrancotoso/brkgaAPI/.
   Google Scholar
• Conover, W. J. (1980). Practical nonparametric statistics. New York: John Wiley.
   Google Scholar
• Emmons, H. (1987). Scheduling to a common due date on parallel uniform processors. Naval Research Logistics, 34(6), 803–810. doi: 10.1002/1520-6750(198712)34:6<803::AID-NAV3220340605>3.0.CO;2-2
   Web of Science ®Google Scholar
• Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman.
   Google Scholar
• Gonçalves, J. F., & Resende, M. G. C. (2011). Biased random-key genetic algorithms for combinatorial optimization. Journal of Heuristics, 17(5), 487–525. doi: 10.1007/s10732-010-9143-1
   Web of Science ®Google Scholar
• Gordon, V., Proth, J.-M., & Chu, C. (2002). A survey of the state-of-the-art of common due date assignment and scheduling research. European Journal of Operational Research, 139(1), 1–25. doi: 10.1016/S0377-2217(01)00181-3
   Web of Science ®Google Scholar
• Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287–326. doi: 10.1016/S0167-5060(08)70356-X
   Google Scholar
• Hall, N. G. (1986). Single- and multiple processor models for minimizing completion time variance. Naval Research Logistics Quarterly, 33(1), 49–54. doi: 10.1002/nav.3800330105
   Google Scholar
• Hall, N. G., & Posner, M. E. (1991). Earliness-tardiness scheduling problems I: weighted deviation of completion times about a common due date. Operations Research, 39(5), 836–846. doi: 10.1287/opre.39.5.836
   Web of Science ®Google Scholar
• Jampani, J., & Mason, S. J. (2008). Column generation heuristics for multiple machine, multiple orders per job scheduling problems. Annals of Operations Research, 159(1), 261–273. doi: 10.1007/s10479-007-0281-2
   Web of Science ®Google Scholar
• Jampani, J., Pohl, E. A., Mason, S. J., & Mönch, L. (2010). Integrated heuristics for scheduling multiple order jobs in a complex job shop. International Journal of Metaheuristics, 1(2), 156–180. doi: 10.1504/IJMHEUR.2010.034204
   Google Scholar
• Jia, J., & Mason, S. J. (2009). Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines. International Journal of Production Research, 47(10), 2565– 2585. doi: 10.1080/00207540701725042
   Web of Science ®Google Scholar
• Jozefowska, J. (2007). Just-in-time scheduling: models and algorithms for computer and manufacturing systems. New York: Springer.
   Google Scholar
• Kanet, J. J. (1981). Minimizing the average deviation of job completion times about a common due date. Naval Research Logistics Quarterly, 28(4), 643–651. doi: 10.1002/nav.3800280411
   Google Scholar
• Kim, J.-G., Kim, J.-S., & Lee, D.-H. (2012). Fast and meta-heuristics for common due-date assignment and scheduling on parallel machines. International Journal of Production Research, 50(20), 6040–6057. doi: 10.1080/00207543.2011.644591
   Web of Science ®Google Scholar
• Laub, J. D., Fowler, J. W., & Keha, A. B. (2007). Minimzing makespan with multiple-orders-per-job in a two-machine flowshop. European Journal of Operational Research, 128(1), 63–79. doi: 10.1016/j.ejor.2006.07.023
   Web of Science ®Google Scholar
• Lauff, V., & Werner, F. (2004). Scheduling with common due date, earliness and tardiness penalties for multimachine problems. Mathematical and Computer Modelling, 40(5–6), 637–655. doi: 10.1016/j.mcm.2003.05.019
   Google Scholar
• Li, X., Chen, H., Xu, R., & Li, X. (2015). Earliness–tardiness minimization on scheduling a batch processing machine with non-identical job sizes. Computers & Industrial Engineering, 87, 590–599. doi: 10.1016/j.cie.2015.06.008
   Web of Science ®Google Scholar
• Mason, S. J., Qu, P., Kutanoglu, E., & Fowler, J. W. (2004). The single machine multiple orders per job scheduling problem (Technical Report No. ASUIE-ORPS-2004-04). Tempe: Arizona State University.
   Google Scholar
• Mathirajan, M., & Sivakumar, A. I. (2006). Literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. The International Journal of Advanced Manufacturing Technology, 29(9-10), 990–1001. doi: 10.1007/s00170-005-2585-1
   Web of Science ®Google Scholar
• Michalewicz, Z. (1996). Genetic algorithms + data structures = evolution programs (3rd ed.). Berlin: Springer.
   Google Scholar
• Mönch, L. (2002). A genetic algorithm heuristic applied to stepper scheduling. In G. T. Mackulak, J. W. Fowler, and A. Schömig (Eds.), Proceedings of the International Conference on Modeling and Analysis of Semiconductor Manufacturing (MASM 2002) (pp. 276–281), Tempe, USA.
   Google Scholar
• Mönch, L., Fowler, J. W., Dauzère-Pérès, S., Mason, S. J., & Rose, O. (2011). A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations. Journal of Scheduling, 14(6), 583–595. doi: 10.1007/s10951-010-0222-9
   Web of Science ®Google Scholar
• Mönch, L., Fowler, J. W., & Mason, S. J. (2013). Production planning and control for wafer fabrication facilities: modeling, analysis, and systems. New York: Springer.
   Google Scholar
• Mönch, L., & Roob, S. (2018). A matheuristic framework for batch machine scheduling problems with incompatible job families and regular sum objective. Applied Soft Computing, 68, 835–846. doi: 10.1016/j.asoc.2017.10.028
   Web of Science ®Google Scholar
• Mönch, L., & Unbehaun, R. (2007). Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date. Computers & Operations Research, 34(11), 3380–3396. doi: 10.1016/j.cor.2006.02.003
   Web of Science ®Google Scholar
• Mönch, L., Unbehaun, R., & Choung, Y. I. (2006). Minimizing earliness and tardiness on a single burn-in oven with a common due date and a maximum available tardiness constraint. Or Spectrum, 28(2), 177–198. doi: 10.1007/s00291-005-0013-4
   Web of Science ®Google Scholar
• Ogun, B., & Alabas-Uslu, C. (2018). Mathematical models for a batch scheduling problem to minimize earliness and tardiness. Journal of Industrial Engineering and Management, 11(3), 390–405. doi: 10.3926/jiem.2541
   Google Scholar
• Parsa, N. R., Karimi, B., & Moattar Husseini, S. M. (2017). Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system. Computers & Operations Research, 80, 173–183. doi: 10.1016/j.cor.2016.12.001
   Web of Science ®Google Scholar
• Pei, J., Cheng, B., Liu, X., Pardalos, P. M., & Kong, M. (2019). Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time. Annals of Operations Research, 272(1-2), 217–241. doi: 10.1007/s10479-017-2481-8
   Web of Science ®Google Scholar
• Pei, J., Liu, X., Pardalos, P. M., Fan, W., & Yang, S. (2017a). Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times. Annals of Operations Research, 249(1-2), 175–195. doi: 10.1007/s10479-015-1824-6
   Web of Science ®Google Scholar
• Pei, J., Liu, X., Pardalos, P. M., Migdalas, A., & Yang, S. (2017b). Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine. Journal of Global Optimization, 67(1-2), 251–262. doi: 10.1007/s10898-015-0320-5
   Web of Science ®Google Scholar
• Potts, C. N., & Kovalyov, M. Y. (2000). Scheduling with batching: a review. European Journal of Operational Research, 120(2), 228–249. doi: 10.1016/S0377-2217(99)00153-8
   Web of Science ®Google Scholar
• Rocholl, J., & Mönch, L. (2017). Hybrid heuristics for multiple orders per job scheduling problem with parallel machines and a common due date. In A. Gunawan, G. Kendall, L. S. Lee, B. McCollum, & H.-V. Seow (Eds.) Proceedings MISTA 2017. (pp. 358–361). Kuala Lumpur, Malaysia.
   Google Scholar
• Rocholl, J., & Mönch, L. (2018). Hybrid algorithms for the earliness-tardiness single-machine multiple orders per job scheduling problem with a common due date. Rairo - Operations Research, 52(4-5), 1329– 1350. doi: 10.1051/ro/2018029
   Web of Science ®Google Scholar
• Sarin, S. C., Wang, L., & Cheng, M. (2012). Minimising makespan for a two-machine, flow shop, single-wafer-processing, multiple-jobs-per-carrier scheduling problem. International Journal of Planning and Scheduling, 1(3), 171–208. doi: 10.1504/IJPS.2012.050126
   Google Scholar
• Semi. (2018). 450mm. Retrieved from http://www1.semi.org/en/450mm.
   Google Scholar
• Sobeyko, O., & Mönch, L. (2015). Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems. Annals of Operations Research, 235(1), 709–739. doi: 10.1007/s10479-015-1976-4
   Web of Science ®Google Scholar
• Suriyaarachchi, R. H., & Wirth, A. (2004). Earliness/tardiness scheduling with a common due date and family setups. Computers & Industrial Engineering, 47, 275–288. doi: 10.1016/j.cie.2004.07.006
   Web of Science ®Google Scholar
• Toso, R. F., & Resende, M. G. C. (2011). A C++ application programming interface for biased random-key genetic algorithms. Retrieved from http://mauricio.resende.info/doc/brkgaAPI.pdf.
   Google Scholar
• Voß, S., & Woodruff, D. L. (2006). Introduction to computational optimization models for production planning in a supply chain (2nd ed.). New York: Springer.
   Google Scholar
• Yugma, C., Dauzère-Pérès, S., Artigues, C., Derreumaux, A., & Sibille, O. (2012). A batching and scheduling algorithm for the diffussion area in semiconductor manufacturing. International Journal of Production Research, 50(8), 2118–2132. doi: 10.1080/00207543.2011.575090
   Web of Science ®Google Scholar
• Zhao, H., Hu, F., & Li, G. (2006). Batch scheduling with a common due window on a single machine. In Proceedings of the International Conference on Fuzzy Systems and Knowledge Discovery 2006. LNCS 4223, 641–645.
   Google Scholar