An improved exact algorithm for single-machine scheduling to minimise the number of tardy jobs with periodic maintenance

References

• Chen, W. J. 2006a. “Minimizing Total Flow Time in the Single-machine Scheduling Problem with Periodic Maintenance.” Journal of the Operational Research Society 57 (4): 410–415.
   Web of Science ®Google Scholar
• Chen, J. S. 2006b. “Single-machine Scheduling with Flexible and Periodic Maintenance.” Journal of the Operational Research Society 57 (6): 703–710.
   Web of Science ®Google Scholar
• Chen, J. S. 2008. “Scheduling of Nonresumable Jobs and Flexible Maintenance Activities on a Single Machine to Minimize Makespan.” European Journal of Operations Research 190 (1): 90–102.
   Web of Science ®Google Scholar
• Chen, W. J. 2009. “Minimizing Number of Tardy Jobs on a Single Machine Subject to Periodic Maintenance.” Omega 37 (3): 591–599.
   Web of Science ®Google Scholar
• Entezari, S., and S. Gholami. 2015. “Multi-objective Flexible Flow Shop Scheduling with Unexpected Arrivals of New Jobs.” Applied Mathematics in Engineering, Management and Technology 3 (3): 172–181.
   Google Scholar
• Graham, R. L., E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooykan. 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey.” Annals of Discrete Mathematics 5: 287–326.
   Google Scholar
• Ji, M., Y. He, and T. C. E. Cheng. 2007. “Single-machine Scheduling with Periodic Maintenance to Minimize Makespan.” Computers & Operations Research 34 (6): 1764–1770.
   Web of Science ®Google Scholar
• Kacem, I., and C. B. Chu. 2008. “Efficient Branch-and-bound Algorithm for Minimizing the Weighted Sum of Completion Times on a Single Machine with One Availability Constraint.” International Journal of Production Economics 112 (1): 138–150.
   Web of Science ®Google Scholar
• Kacem, I., C. B. Chu, and A. Souissi. 2008. “Single-machine Scheduling with an Availability Constraint to Minimize the Weighted Sum of the Completion Times.” Computers & Operations Research 35 (3): 827–844.
   Web of Science ®Google Scholar
• Lee, C. Y. 1996. “Machine Scheduling with an Availability Constraint.” Journal of Global Optimization 9 (3–4): 395–416.
   Web of Science ®Google Scholar
• Lee, J. Y., and Y. D. Kim. 2012. “Minimizing the Number of Tardy Jobs in a Single-machine Scheduling Problem with Periodic Maintenance.” Computers & Operations Research 39 (9): 2196–2205.
   Web of Science ®Google Scholar
• Lee, C. Y., and S. D. Liman. 1992. “Single Machine Flow-time Scheduling with Scheduled Maintenance.” Acta Informatica 29 (4): 375–382.
   Web of Science ®Google Scholar
• Liao, C. J., and W. J. Chen. 2003. “Single-machine Scheduling with Periodic Maintenance and Nonresumable Jobs.” Computers & Operations Research 30 (9): 1335–1347.
   Web of Science ®Google Scholar
• Liu, M., Y. F. Xu, C. B. Chu, and F. F. Zheng. 2009. “Online Scheduling to Minimize Modifed Total Tardiness with an Availability Constraint.” Theoretical Computer Science 410 (47): 5039–5046.
   Web of Science ®Google Scholar
• Liu, M., F. F. Zheng, C. B. Chu, and Y. F. Xu. 2011. “Optimal Algorithms for Online Scheduling on Parallel Machines to Minimize the Makespan with a Periodic Availability Constraint.” Theoretical Computer Science 412 (39): 5225–5231.
   Web of Science ®Google Scholar
• Low, C. Y., M. Ji, C. J. Hsu, and C. T. Su. 2010. “Minimize the Makespan in a Single Machine Scheduling Problems with Flexible and Periodic Maintenance.” Applied Mathematical Modelling 34 (2): 334–342.
   Web of Science ®Google Scholar
• Ma, Y., C. B. Chu, and C. R. Zuo. 2010. “A Survey of Scheduling with Deterministic Machine Availability Constraints.” Computers & Industrial Engineering 58 (2): 199–211.
   Web of Science ®Google Scholar
• Mellouli, R., C. Sadfi, C. B. Chu, and I. Kacem. 2008. “Identical Parallel-machine Scheduling under Availability Constraints to Minimize the Sum of Completion Times.” European Journal of Operational Research 197 (3): 1150–1165.
   Web of Science ®Google Scholar
• Moore, J. M. 1968. “An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs.” Management Science 15: 102–109.
   Web of Science ®Google Scholar
• Pinedo, M. 2000. Scheduling: Theory, Algorithms, and Systems. 2nd ed. Englewood Cliffs, NJ: Prentice-Hall.
   Google Scholar
• Rafie-Majd, Z., M. Mohammadi, and B. Naderi. 2015. “Solving the Multi-objective Flexible Job Shop Scheduling Problem by the Population-based Algorithms.” Applied Mathematics in Engineering, Management and Technology 3 (2): 148–155.
   Google Scholar
• Ruiz, R., J. C. García-Díaz, and C. Maroto. 2007. “Considering Scheduling and Preventive Maintenance in the Flowshop Sequencing Problem.” Computers & Operations Research 34 (11): 3314–3330.
   Web of Science ®Google Scholar
• Sadfi, C., B. Penz, C. Rapine, J. Blazewicz, and P. Formanowicz. 2005. “An Improved Approximation Algorithm for the Single Machine Total Completion Time Scheduling Problem with Availability Constraints.” European Journal of Operational Research 161 (1): 3–10.
   Web of Science ®Google Scholar
• Sanlaville, E., and G. Schmidt. 1998. “Machine Scheduling with Availability Constraints.” Acta Informatica 35 (9): 795–811.
   Web of Science ®Google Scholar
• Sbihi, M., and C. Varnier. 2008. “Single-machine Scheduling with Periodic and Flexible Periodic Maintenance to Minimize Maximum Tardiness.” Computers & Industrial Engineering 56 (4): 830–840.
   Web of Science ®Google Scholar
• Wang, H. Z. 2002. “A Survey of Maintenance Policies of Deteriorating Systems.” European Journal of Operational Research 169 (3): 469–489.
   Web of Science ®Google Scholar
• Wang, S. J., and M. Liu. 2013. “A Branch and Bound Algorithm for Single-machine Production Scheduling Integrated with Preventive Maintenance Planning.” International Journal of Production Research 51 (3): 847–868.
   Web of Science ®Google Scholar
• Wang, G., H. Sun, and C. B. Chu. 2005. “Preemptive Scheduling with Availability Constraints to Minimize Total Weighted Completion Times.” Annals of Operations Research 133 (1): 183–192.
   Web of Science ®Google Scholar
• Xu, D., K. Sun, and H. Li. 2008. “Parallel Machine Scheduling with Almost Periodic Maintenance and Non-preemptive Jobs to Minimize Makespan.” Computers & Operations Research 35 (4): 1344–1349.
   Web of Science ®Google Scholar
• Xu, D., K. Sun, and H. Li. 2009. “A Note on Scheduling of Nonresumable Jobs and Flexible Maintenance Activities on a Single Machine to Minimize Makespan.” European Journal of Operations Research 197 (2): 825–827.
   Web of Science ®Google Scholar
• Yang, S. L., Y. Ma, D. L. Xu, and J. B. Yang. 2011. “Minimizing Total Completion Time on a Single Machine with a Flexible Maintenance Activity.” Computers & Operations Research 38 (4): 755–770.
   Web of Science ®Google Scholar
• Yang, S. J., and D. L. Yang. 2010. “Minimizing the Makespan on Single-machine Scheduling with aging Effect and Variable Maintenance Activities.” Omega 38 (6): 528–533.
   Web of Science ®Google Scholar
• Yu, X. Y., Y. L. Zhang, and G. Steiner. 2014. “Single-machine Scheduling with Periodic Maintenance to Minimize Makespan Revisited.” Journal of Scheduling 17: 263–270.
   Web of Science ®Google Scholar
• Zabiehzadeha, L., and B. Naderib. 2015. “Metaheuristics for Hybrid Flow Shop Scheduling.” Applied mathematics in Engineering, Management and Technology 3 (3): 162–171.
   Google Scholar