Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work

References

• Blazewicz, J. 1984. “Scheduling Preemptible Tasks on Parallel Processors With Information Loss.” TSI-Technique et Science Informatiques 3: 415–420.
   Google Scholar
• Brucker, P. 2008. Scheduling Algorithm. Berlin: Springer.
   Google Scholar
• Chen, R. B., R. Y. He, and J. J. Yuan. 2022. “Preemptive Scheduling to Minimize Total Weighted Late Work and Weighted Number of Tardy Jobs.” Computers & Industrial Engineering 167: Article ID 107969. doi:10.1016/j.cie.2022.107969.
   Web of Science ®Google Scholar
• Chen, R. X., and S. S. Li. 2021. “Proportionate Flow Shop Scheduling With Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs.” Asia-Pacific Journal of Operational Research 38 (02): Article ID 2050046. doi:10.1142/S0217595920500463.
   Google Scholar
• Chen, X., M. Sterna, X. Han, and J. Blazewicz. 2016. “Scheduling on Parallel Identical Machines With Late Work Criterion: Offline and Online Cases.” Journal of Scheduling 19 (6): 729–736. doi:10.1007/s10951-015-0464-7.
   Web of Science ®Google Scholar
• Chen, X., Z. Y. Wang, E. Pesch, M. Sterna, and J. Blazewicz. 2019. “Two-Machine Flow-Shop Scheduling to Minimize Total Late Work: Revisited.” Engineering Optimization 51 (7): 1268–1278. doi:10.1080/0305215X.2018.1519073.
   Web of Science ®Google Scholar
• Chen, R. B., J. J. Yuan, C. T. Ng, and T. C. E. Cheng. 2019. “Single Machine Scheduling With Deadlines to Minimize the Total Weighted Late Work.” Naval Research Logistics 66 (7): 582–595. doi:10.1002/nav.v66.7.
   Web of Science ®Google Scholar
• Chen, R. B., J. J. Yuan, C. T. Ng, and T. C. E. Cheng. 2021. “Bicriteria Scheduling to Minimize Total Late Work and Maximum Tardiness With Preemption.” Computers & Industrial Engineering 159: Article ID 107525. doi:10.1016/j.cie.2021.107525.
   Web of Science ®Google Scholar
• Choi, B. C., K. M. Kim, Y. H. Min, and M. J. Park. 2022. “A Single Machine Scheduling With Generalized and Periodic Due Dates to Minimize Total Deviation.” Discrete Applied Mathematics 314: 31–52. doi:10.1016/j.dam.2022.03.002.
   Web of Science ®Google Scholar
• Choi, B. C., K. M. Kim, Y. H. Min, and M. J. Park. 2022. “Scheduling With Generalized and Periodic Due Dates Under Single- and Two-machine Environments.” Optimization Letters 16 (2): 623–633. doi:10.1007/s11590-021-01739-8.
   Web of Science ®Google Scholar
• Choi, B. C., Y. Min, and M. J. Park. 2019. “Strong NP-hardness of Minimizing Total Deviation With Generalized and Periodic Due Dates.” Operations Research Letters 47 (5): 433–437. doi:10.1016/j.orl.2019.08.002.
   Web of Science ®Google Scholar
• Freud, D., and G. Mosheiov. 2021. “Scheduling With Competing Agents, Total Late Work and Job Rejection.” Computer & Operations Research 133: Article ID 105329. doi:10.1016/j.cor.2021.105329.
   Web of Science ®Google Scholar
• Gao, Y., and J. J. Yuan. 2015. “Unary NP-hardness of Minimizing the Total Deviation With Generalized Or Assignable Due Dates.” Discrete Applied Mathematics 189: 49–52. doi:10.1016/j.dam.2015.03.011.
   Web of Science ®Google Scholar
• Gao, Y., and J. J. Yuan. 2016. “Unary NP-hardness of Minimizing Total Weighted Tardiness With Generalized Due Dates.” Operations Research Letters 44 (1): 92–95. doi:10.1016/j.orl.2015.12.006.
   Web of Science ®Google Scholar
• Garey, M. R., and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman.
   Google Scholar
• Gerstl, E., B. Mor, and G. Mosheiov. 2019. “Scheduling on a Proportionate Flowshop to Minimise Total Late Work.” International Journal of Production Research 57 (2): 531–543. doi:10.1080/00207543.2018.1456693.
   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. 2020. “Single Machine Scheduling to Maximize the Number of on-time Jobs With Generalized Due-dates.” Journal of Scheduling 23 (3): 289–299. doi:10.1007/s10951-020-00638-7.
   Web of Science ®Google Scholar
• Guo, S. E., L. F. Lu, J. J. Yuan, C. T. Ng, and T. C. E. Cheng. 2022. “Pareto-scheduling With Double-weighted Jobs to Minimize the Weighted Number of Tardy Jobs and Total Weighted Late Work.” Naval Research Logistics 69 (5): 816–837. doi:10.1002/nav.v69.5.
   Web of Science ®Google Scholar
• Hall, N. G. 1986. “Scheduling Problems With Generalized Due Dates.” IIE Transections 18 (2): 220–222. doi:10.1080/07408178608975351.
   Web of Science ®Google Scholar
• Hall, N. G., S. P. Sethi, and C. Sriskandarajah. 1991. “On the Complexity of Generalized Due Date Scheduling Problems.” European Journal of Operational Research 51 (1): 100–109. doi:10.1016/0377-2217(91)90149-P.
   Web of Science ®Google Scholar
• Hariri, A. M. A., C. N. Potts, and L. N. Van Wassenhove. 1995. “Single Machine Scheduling to Minimize Total Weighted Late Work.” ORSA Journal on Computing 7 (2): 232–242. doi:10.1287/ijoc.7.2.232.
   Google Scholar
• He, R. Y., J. J. Yuan, C. T. Ng, and T. C. E. Cheng. 2021. “Two-agent Preemptive Pareto-scheduling to Minimize the Number of Tardy Jobs and Total Late Work.” Journal of Combinatorial Optimization 41 (2): 504–525. doi:10.1007/s10878-021-00697-2.
   Web of Science ®Google Scholar
• Ji, M., W. Y. Zhang, L. J. Liao, T. C. E. Cheng, and Y. Y. Tan. 2019. “Multitasking Parallel-machine Scheduling With Machine-dependent Slack Due-window Assignment.” International Journal of Production Research 57 (6): 1667–1684. doi:10.1080/00207543.2018.1497312.
   Web of Science ®Google Scholar
• Kovalyov, M. Y., C. N. Potts, and L. N. Van Wassenhove. 1994. “A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work.” Mathematics of Operations Research 19 (1): 86–93. doi:10.1287/moor.19.1.86.
   Web of Science ®Google Scholar
• Li, S. S., and J. J. Yuan. 2020. “Single-machine Scheduling With Multi-agents to Minimize Total Weighted Late Work.” Journal of Scheduling 23 (4): 497–512. doi:10.1007/s10951-020-00646-7.
   Web of Science ®Google Scholar
• Liu, M., S. J. Wang, F. F. Zheng, and C. B. 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
• Mor, B., G. Mosheiov, and D. Shabtay. 2021. “Minimizing the Total Tardiness and Job Rejection Cost in a Proportionate Flow Shop With Generalized Due Dates.” Journal of Scheduling 24 (6): 553–567. doi:10.1007/s10951-021-00697-4.
   Web of Science ®Google Scholar
• Mor, B., and D. Shabtay. 2022. “Single-machine Scheduling With Total Late Work and Job Rejection.” Computers & Industrial Engineering, 169: Article ID 108168. doi:10.1016/j.cie.2022.108168.
   Web of Science ®Google Scholar
• Mosheiov, G., D. Oron, and D. Shabtay. 2021. “Minimizing Total Late Work on a Single Machine With Generalized Due-dates.” European Journal of Operational Research 293 (3): 837–846. doi:10.1016/j.ejor.2020.12.061.
   Web of Science ®Google Scholar
• Mosheiov, G., D. Oron, and D. Shabtay. 2022. “On the Tractability of Hard Scheduling Problems With Generalized Due-dates With Respect to the Number of Different Due-dates.” Journal of Scheduling 25 (5): 577–587. doi:10.1007/s10951-022-00743-9.
   Web of Science ®Google Scholar
• Park, M. J., B. C. Choi, Y. Min, and K. M. Kim. 2020. “Two-machine Ordered Flow Shop Scheduling With Generalized Due Dates.” Asia-Pacific Journal of Operational Research 37 (01): Aritcle ID 1950032. doi:10.1142/S0217595919500325.
   Google Scholar
• Potts, C. N., and L. N. Van Wassenhove. 1992a. “Single Machine Scheduling to Minimize Total Late Work.” Operations Research 40 (3): 586–595. doi:10.1287/opre.40.3.586.
   Web of Science ®Google Scholar
• Potts, C. N., and L. N. Van Wassenhove. 1992b. “Approximation Algorithms for Scheduling a Single Machine to Minimize Total Late Work.” Operations Research Letters 11 (5): 261–266. doi:10.1016/0167-6377(92)90001-J.
   Web of Science ®Google Scholar
• Qi, X. T., G. Yu, and J. F. Bard. 2002. “Single Machine Scheduling With Assignable Due Dates.” Discrete Applied Mathematics 122 (1–3): 211–233. doi:10.1016/S0166-218X(01)00316-X.
   Web of Science ®Google Scholar
• Shabtay, D., G. Mosheiov, and D. Oron. 2022. “Single Machine Scheduling With Common Assignable Due Date/due Window to Minimize Total Weighted Early and Late Work.” European Journal of Operational Research 303 (1): 66–77. doi:10.1016/j.ejor.2022.02.017.
   Web of Science ®Google Scholar
• Sriskandarajah, C. 1990. “A Note on the Generalized Due Dates Scheduling Problems.” Naval Research Logistics 37: 587–597. doi:10.1002/(ISSN)1520-6750.
   Web of Science ®Google Scholar
• Sterna, M. 2011. “A Survey of Scheduling Problems Problems With Late Work Criteria.” Omega 39: 120–129. doi:10.1016/j.omega.2010.06.006.
   Web of Science ®Google Scholar
• Sterna, M. 2021. “Late and Early Work Scheduling: a Survey.” Omega 104: Aritcle ID 102453. doi:10.1016/j.omega.2021.102453.
   Web of Science ®Google Scholar
• Xiong, X. Y., D. J. Wang, T. C. E. Cheng, C. C. Wu, and Y. Q. 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
• Yin, Y. Q, S. R. Cheng, T. C. E. Cheng, C. C. Wu, and W. H. Wu. 2012. “Two-agent Single-machine Scheduling With Assignable Due Dates.” Applied Mathematics and Computation 219 (4): 1674–1685. doi:10.1016/j.amc.2012.08.008.
   Web of Science ®Google Scholar
• Yuan, J. J. 2022. “The Scheduling Problem With Assignable or Generalized Due Dates to Minimize Total Weighted Late Work.” In Symposium on Combinatorial Optimization and Graph Theory, Nanjing University, June 2022. https://math.nju.edu.cn/fzlm/xshy19082/20220614/i223737.html.
   Google Scholar
• Zhang, X. G. 2021. “Two Competitive Agents to Minimize the Weighted Total Late Work and the Total Completion Time.” Applied Mathematics and Computation 406: Article ID 126286. doi:10.1016/j.amc.2021.126286.
   Web of Science ®Google Scholar
• Zhang, Y., J. J. Yuan, C. T. Ng, and T. C. E. Cheng. 2021. “Pareto-optimization of Three-agent Scheduling to Minimize the Total Weighted Completion Time, Weighted Number of Tardy Jobs, and Total Weighted Late Work.” Naval Research Logistics 68 (3): 378–393. doi:10.1002/nav.v68.3.
   Web of Science ®Google Scholar