Single-machine scheduling and common due date assignment with potential machine disruption

References

• Adiri, I., J. Bruno, E. Frostig, and A. H. G. Rinnooy Kan. 1989. “Single Machine Flow-time Scheduling with a Single Breakdown.” Acta Informatica 26: 679–696.
   Web of Science ®Google Scholar
• Cheng, T. C. E., and M. C. Gupta. 1989. “Survey of Scheduling Research Involving Due Date Determination Decisions.” European Journal of Operational Research 38: 156–166.
   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–25.
   Web of Science ®Google Scholar
• Gordon, V., V. Strusevich, and A. Dolgui. 2012. “Scheduling with Due Date Assignment under Special Conditions on Job Processing.” Journal of Scheduling 15: 447–456.
   Web of Science ®Google Scholar
• Hardy, G. H., J. E. Littlewood, and G. Polya. 1967. Inequalities. London: Cambridge University Press.
   Google Scholar
• Janiak, A., W. A. Janiak, T. Krysiak, and T. Kwiatkowski. 2015. “A Survey on Scheduling Problems with Due Windows.” European Journal of Operational Research 242: 347–357.
   Web of Science ®Google Scholar
• Lauff, V., and F. Werner. 2004. “Scheduling with Common Due Date, Earliness and Tardiness Penalties for Multimachine Problems: A Survey.” Mathematical and Computer Modelling 40: 637–655.
   Web of Science ®Google Scholar
• Lee, C. Y. 1996. “Machine Scheduling with An Availability Constraint.” Journal of Global Optimization 9: 363–384.
   Web of Science ®Google Scholar
• Lee, C. Y., L. Lei, and M. Pinedo. 1997. “Current Trends in Deterministic Scheduling.” Annals of Operations Research 70: 1–41.
   Web of Science ®Google Scholar
• Lee, C. Y., and G. Yu. 2007. “Single Machine Scheduling Under Potential Disruption.” Operations Research Letters 35: 541–548.
   Web of Science ®Google Scholar
• Lee, C. Y., and G. Yu. 2008. “Parallel-machine Scheduling Under Potential Disruption.” Optimization Letters 2: 27–37.
   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. doi:10.1080/00207543.2017.1321804.
   PubMed Web of Science ®Google Scholar
• Ma, Y., C. Chu, and C. Zuo. 2010. “A Survey of Scheduling with Deterministic Machine Availability Constraints.” Computers & Industrial Engineering 58: 199–211.
   Web of Science ®Google Scholar
• Mor, B., and G. Mosheiov. 2015. “Scheduling a Deteriorating Maintenance Activity and Due-window Assignment.” Computers & Operations Research 57: 33–40.
   Web of Science ®Google Scholar
• Mosheiov, G., and J. B. Sidney. 2010. “Scheduling a Deteriorating Maintenance Activity on a Single Machine.” Journal of the Operational Research Society 61: 882–887.
   Web of Science ®Google Scholar
• Sanlaville, E., and G. Schmidt. 1998. “Machine Scheduling with Availability Constraints.” Acta Informatica 35: 795–811.
   Web of Science ®Google Scholar
• Schmidt, G. 2000. “Scheduling with Limited Machine Availability.” European Journal of Operational Research 121: 1–15.
   Web of Science ®Google Scholar
• Sun, L. H., K. Cui, J. H. Chen, and J. Wang. 2016. “Due Date Assignment and Convex Resource Allocation Scheduling with Variable Job Processing Times.” International Journal of Production Research 54: 3551–3560.
   Web of Science ®Google Scholar
• Wang, D., Y. Yin, S. R. Cheng, T. C. E. Cheng, and C. C. Wu. 2016. “Due Date Assignment and Scheduling on A Single Machine with Two Competing Agents.” International Journal of Production Research 54: 1152–1169.
   Web of Science ®Google Scholar
• Woeginger, G. J. 2000. “When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?” INFORMS Journal on Computing 12: 57–75.
   Web of Science ®Google Scholar
• Yang, S. J., D. L. Yang, and T. C. E. Cheng. 2010. “Single-machine Due-window Assignment and Scheduling with Job-dependent Aging Effects and Deteriorating Maintenance.” Computers & Operations Research 37: 1510–1514.
   Web of Science ®Google Scholar
• Yin, Y., M. Liu, T. C. E. Cheng, C. C. Wu, and S. R. Cheng. 2013. “Four Single-machine Scheduling Problems Involving Due Date Determination Decisions.” Information Sciences 251: 164–181.
   Web of Science ®Google Scholar
• Yin, Y., Y. Wang, T. C. E. Cheng, W. Liu, and J. Li. 2017. “Parallel-machine Scheduling of Deteriorating Jobs with Potential Machine Disruptions.” Omega 69: 17–28.
   Web of Science ®Google Scholar
• Yin, Y., D. J. Wang, C. C. Wu, and T. C. E. Cheng. 2016. “Due-Date Assignment and Scheduling on a Single Machine with Two Agents.” Naval Research Logistics 63: 416–429.
   Web of Science ®Google Scholar
• Yin, Y., W. H. Wu, T. C. E. Cheng, and C. C. Wu. 2014. “Due-date Assignment and Single-machine Scheduling with Generalised Position-dependent Deteriorating Jobs and Deteriorating Multi-maintenance Activities.” International Journal of Production Research 52: 2311–2326.
   Web of Science ®Google Scholar
• Zheng, B., M. Fan, M. Liu, S. S. Liu, and Y. Yin. 2017. “Parsllel-machine Scheduling with Potential Disruption and Positional-dependent Processing Times.” Journal of Industrial and Management Optimization 13: 697–711.
   Web of Science ®Google Scholar