A common due-date assignment problem with job rejection on parallel uniform machines

References

• Arık, O. A., and M. D. Toksarı. 2018. “Multi-Objective Fuzzy Parallel Machine Scheduling Problems Under Fuzzy Job Deterioration and Learning Effects.” International Journal of Production Research 56 (7): 2488–2505. doi:10.1080/00207543.2017.1388932
   Web of Science ®Google Scholar
• Bülbül, K., S. Kedad-Sidhoum, and H. Şen. 2019. “Single-Machine Common Due Date Total Earliness/Tardiness Scheduling with Machine Unavailability.” Journal of Scheduling 22 (5): 543–565. doi:10.1007/s10951-018-0585-x
   Web of Science ®Google Scholar
• Chen, X., Y. Liang, M. Sterna, W. Wang, and J. Błażewicz. 2020. “Fully Polynomial Time Approximation Scheme to Maximize Early Work on Parallel Machines with Common Due Date.” European Journal of Operational Research 284 (1): 67–74. doi:10.1016/j.ejor.2019.12.003
   Web of Science ®Google Scholar
• Falq, A. E., P. Fouilhoux, and S. Kedad-Sidhoum. 2021. “Mixed Integer Formulations Using Natural Variables for Single Machine Scheduling Around a Common Due Date.” Discrete Applied Mathematics 290: 36–59. doi:10.1016/j.dam.2020.08.033
   Web of Science ®Google Scholar
• Gao, F., M. Liu, J. J. Wang, and Y. Y. Lu. 2018. “No-Wait Two-Machine Permutation Flow Shop Scheduling Problem with Learning Effect, Common Due Date and Controllable Job Processing Times.” International Journal of Production Research 56 (6): 2361–2369. doi:10.1080/00207543.2017.1371353
   Web of Science ®Google Scholar
• Gerstl, E., and G. Mosheiov. 2017. “Single Machine Scheduling Problems with Generalized Due-Dates and Job-Rejection.” International Journal of Production Research 55 (11): 3164–3172. doi:10.1080/00207543.2016.1266055
   Web of Science ®Google Scholar
• Gerstl, E., and G. Mosheiov. 2021. “The Single Machine CON Problem with Unavailability Period.” International Journal of Production Research 59 (3): 824–838. doi:10.1080/00207543.2019.1709672
   Web of Science ®Google Scholar
• Gordon, V., J. M. Proth, and C. Chu. 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
• Hall, N. G., W. Kubiak, and S. P. Sethi. 1991. “Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date.” Operations Research 39 (5): 847–856. doi:10.1287/opre.39.5.847
   Web of Science ®Google Scholar
• Kellerer, H., K. Rustogi, and V. A. Strusevich. 2020. “A Fast FPTAS for Single Machine Scheduling Problem of Minimizing Total Weighted Earliness and Tardiness About a Large Common due Date.” Omega 90: 101992. doi:10.1016/j.omega.2018.11.001
   Web of Science ®Google Scholar
• Kuhn, H. W. 1955. “The Hungarian Method for the Assignment Problem.” Naval Research Logistics Quarterly 2 (1-2): 83–97. doi:10.1002/nav.3800020109
   Google Scholar
• Li, S. S., and R. X. Chen. 2020. “Scheduling with Common Due Date Assignment to Minimize Generalized Weighted Earliness–Tardiness Penalties.” Optimization Letters 14: 1681–1699. doi:10.1007/s11590-019-01462-5
   Web of Science ®Google Scholar
• Li, Z., R. Y. Zhong, A. V. Barenji, J. J. Liu, C. X. Yu, and G. Q. Huang. 2019. “Bi-Objective Hybrid Flow Shop Scheduling with Common due Date.” Operational Research 21: 1153–1178.
   Web of Science ®Google Scholar
• Liu, M., S. Wang, F. Zheng, and C. Chu. 2017. “Algorithms for the Joint Multitasking Scheduling and Common Due Date Assignment Problem.” International Journal of Production Research 55 (20): 6052–6066. doi:10.1080/00207543.2017.1321804
   Web of Science ®Google Scholar
• Lv, D. Y., and J. B. Wang. 2021. “Study on Proportionate Flowshop Scheduling with Due-Date Assignment and Position-Dependent Weights.” Optimization Letters 15 (6): 2311–2319.
   Web of Science ®Google Scholar
• Mor, B. 2018. “Minmax Common Due-Window Assignment and Scheduling on a Single Machine with Two Competing Agents.” Journal of the Operational Research Society 69 (4): 589–602.
   Web of Science ®Google Scholar
• Mor, B. 2019. “Minmax Scheduling Problems with Common due-Date and Completion Time Penalty.” Journal of Combinatorial Optimization 38 (1): 50–71. doi:10.1007/s10878-018-0365-8
   Web of Science ®Google Scholar
• Mosheiov, G., and S. Pruwer. 2021. “On the Minmax Common-Due-Date Problem: Extensions to Position-Dependent Processing Times, job Rejection, Learning Effect, Uniform Machines and Flowshops.” Engineering Optimization 53 (3): 408–424. doi:10.1080/0305215X.2020.1735380
   Web of Science ®Google Scholar
• Mosheiov, G., and A. Sarig. 2009. “Due-Date Assignment on Uniform Machines.” European Journal of Operational Research 193 (1): 49–58. doi:10.1016/j.ejor.2007.10.043
   Web of Science ®Google Scholar
• Mosheiov, G., and U. Yovel. 2006. “Minimizing Weighted Earliness–Tardiness and Due-Date Cost with Unit Processing-Time Jobs.” European Journal of Operational Research 172 (2): 528–544. doi:10.1016/j.ejor.2004.10.021
   Web of Science ®Google Scholar
• Nasrollahi, V., G. Moslehi, and M. Reisi-Nafchi. 2022. “Minimizing the Weighted Sum of Maximum Earliness and Maximum Tardiness in a Single-Agent and Two-Agent Form of a Two-Machine Flow Shop Scheduling Problem.” Operational Research, 1–40.
   Web of Science ®Google Scholar
• Rocholl, J., and L. Mönch. 2021. “Decomposition Heuristics for Parallel-Machine Multiple Orders Per Job Scheduling Problems with a Common Due Date.” Journal of the Operational Research Society 72 (8): 1737–1753.
   Web of Science ®Google Scholar
• Shabtay, D., N. Gaspar, and M. Kaspi. 2013. “A Survey on Offline Scheduling with Rejection.” Journal of Scheduling 16 (1): 3–28. doi:10.1007/s10951-012-0303-z
   Web of Science ®Google Scholar
• T’kindt, V., L. Shang, and F. Della Croce. 2020. “Exponential Time Algorithms for Just-in-Time Scheduling Problems with Common Due Date and Symmetric Weights.” Journal of Combinatorial Optimization 39 (3): 764–775. doi:10.1007/s10878-019-00512-z
   Web of Science ®Google Scholar
• Xiong, X., D. Wang, T. C. Edwin Cheng, C. C. Wu, and Y. Yin. 2018. “Single-Machine Scheduling and Common Due Date Assignment with Potential Machine Disruption.” International Journal of Production Research 56 (3): 1345–1360. doi:10.1080/00207543.2017.1346317
   Web of Science ®Google Scholar