Minimising total completion time on single-machine scheduling with new integrated maintenance activities

References

• Adiri, I., J. Bruno, E. Frostig, and A. H. G. R. Kan. 1989. “Single Machine Flow-time Scheduling with a Single Breakdown.” Acta Informatica 26 (7): 679–696. doi: 10.1007/BF00288977
   Web of Science ®Google Scholar
• Akturk, M. S., J. B. Ghosh, and E. D. Gunes. 2003. “Scheduling with Tool Changes to Minimize Total Completion Time: A Study of Heuristics and Their Performance.” Naval Research Logistics 50 (1): 15–30. doi: 10.1002/nav.10045
   Web of Science ®Google Scholar
• Akturk, M. S, J. B Ghosh, and E. D Gunes. 2004. “Scheduling with tool changes to minimize total completion time: Basic results and SPT performance.” European Journal of Operational Research 157 (3): 784–790. doi: 10.1016/S0377-2217(03)00232-7
   Web of Science ®Google Scholar
• Breit, J. 2007. “Improved Approximation for Non-preemptive Single Machine Flow-time Scheduling with an Availability Constraint.” European Journal of Operational Research 183 (2): 516–524. doi: 10.1016/j.ejor.2006.10.005
   Web of Science ®Google Scholar
• Chen, J. S. 2006a. “Single-machine Scheduling with Flexible and Periodic Maintenance.” Journal of the Operational Research Society 57 (6): 703–710. doi: 10.1057/palgrave.jors.2602043
   Web of Science ®Google Scholar
• Chen, W. 2006b. “Minimizing Total Flow Time in the Single-machine Scheduling Problem with Periodic Maintenance.” Journal of the Operational Research Society 57 (4): 410–415. doi: 10.1057/palgrave.jors.2601998
   Web of Science ®Google Scholar
• Chen, Jen-Shiang, and Jin-Shan Yang. 2007. “Alternative Models for Solving Single-machine Scheduling with Tool Changes.” International Journal of Information & Management Sciences 18 (3): 283–297.
   Google Scholar
• Cheng, M. B., S. X. Xiao, R. F. Luo, and Z. T. Lian. 2017. “Single-machine Scheduling Problems with a Batch-dependent Aging Effect and Variable Maintenance Activities.” International Journal of Production Research. doi:10.1080/00207543.2017.1398 424.
   PubMed Web of Science ®Google Scholar
• Cui, W. W., and Z. Q. Lu. 2017. “Minimizing the Makespan on a Single Machine with Flexible Maintenances and Jobs’ Release Dates.” Computers & Operations Research 80: 11–22. doi: 10.1016/j.cor.2016.11.008
   Web of Science ®Google Scholar
• Gurel, S., and Akturk, M. S. 2008. “Scheduling Preventive Maintenance on a Single CNC Machine.” International Journal of Production Research 46 (24): 6797–6821. doi: 10.1080/00207540701487833
   Web of Science ®Google Scholar
• Karhi, S., and D. Shabtay. 2017. “Single Machine Scheduling to Minimise Resource Consumption Cost with a Bound on Scheduling Plus due Date Assignment Penalties.” International Journal of Production Research. doi:10.1080/00207543.2017.14007 08.
   PubMed Web of Science ®Google Scholar
• Kovács, A., and J. C. Beck. 2007. Single-machine Scheduling with Tool Changes: A Constraint-based Approach. Paper presented at the Proceedings of the 26th Workshop of the UK Planning and Scheduling Special Interest Group.
   Google Scholar
• Lee, C. Y., and V. J. Leon. 2001. “Machine Scheduling with a Rate-modifying Activity.” European Journal of Operational Research 128 (1): 119–128. doi: 10.1016/S0377-2217(99)00066-1
   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. doi: 10.1007/BF01178778
   Web of Science ®Google Scholar
• Lee, C. Y., and C. S. Lin. 2001. “Single-machine Scheduling with Maintenance and Repair Rate-modifying Activities.” European Journal of Operational Research 135 (3): 493–513. doi: 10.1016/S0377-2217(00)00322-2
   Web of Science ®Google Scholar
• Luo, W. C., T. C. E. Cheng, and M. Ji. 2015. “Single-machine Scheduling with a Variable Maintenance Activity.” Computers & Industrial Engineering 79: 168–174. doi: 10.1016/j.cie.2014.11.002
   Web of Science ®Google Scholar
• Madraki, G., and R. P. Judd. 2017. “Efficient Algorithm to Find Makespan in Manufacturing Systems under Multiple Scheduling Perturbations.” International Journal of Production Research. doi:10.1080/00207543.2017.1407884.
   PubMed Web of Science ®Google Scholar
• Mashkani, O., and G. Moslehi. 2016. “Minimising the Total Completion Time in a Single Machine Scheduling Problem under Bimodal Flexible Periodic Availability Constraints.” International Journal of Computer Integrated Manufacturing 29 (3): 323–341. doi: 10.1080/0951192X.2014.1003413
   Web of Science ®Google Scholar
• Matta, R. D. 2017. “Scheduling a Manufacturing Process with Restrictions on Resource Availability.” International Journal of Production Research. doi:10.1080/00207543.2017.1384583.
   PubMed Web of Science ®Google Scholar
• Ozturkoglu, Y., and R. L. Bulfin. 2011. “A Unique Integer Mathematical Model for Scheduling Deteriorating Jobs with Rate-modifying Activities on a Single Machine.” The International Journal of Advanced Manufacturing Technology 57 (5): 753–762. doi: 10.1007/s00170-011-3303-9
   Web of Science ®Google Scholar
• Qi, X. 2007. “A Note on Worst-case Performance of Heuristics for Maintenance Scheduling Problems.” Discrete Applied Mathematics 155 (3): 416–422. doi: 10.1016/j.dam.2006.06.005
   Web of Science ®Google Scholar
• Qi, X., T. Chen, and F. Tu. 1999. “Scheduling the Maintenance on a Single Machine.” Journal of the Operational Research Society 50 (10): 1071–1078. doi: 10.1057/palgrave.jors.2600791
   Web of Science ®Google Scholar
• Raza, S. A., and U. M. Al-Turki. 2007. “A Comparative Study of Heuristic Algorithms to Solve Maintenance Scheduling Problem.” Journal of Quality in Maintenance Engineering 13 (4): 398–410. doi: 10.1108/13552510710829489
   Google Scholar
• Sadfi, C., B. Penz, and C. Rapine. 2002. A Dynamic Programming Algorithm for the Single Machine Total Completion Time Scheduling Problem with Availability Constraints. Paper presented at the Eighth international Workshop on Project Management and Scheduling, Valence, Spain.
   Google Scholar
• Sadfi, C., B. Penz, C. Rapine, J. Błażewicz, 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. doi: 10.1016/j.ejor.2003.08.026
   Web of Science ®Google Scholar
• Vahedi-Nouri, B., P. Fattahi, M. Rohaninejad, and R. Tavakkoli-Moghaddam. 2013. “Minimizing the Total Completion Time on a Single Machine with the Learning Effect and Multiple Availability Constraints.” Applied Mathematical Modelling 37 (5): 3126–3137. doi: 10.1016/j.apm.2012.07.028
   Web of Science ®Google Scholar
• Yalaoui, F., and C. Chu. 2002. “Parallel Machine Scheduling to Minimize Total Tardiness.” International Journal of Production Economics 76 (3): 265–279. doi: 10.1016/S0925-5273(01)00175-X
   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. doi: 10.1016/j.cor.2010.09.003
   Web of Science ®Google Scholar
• Yang, S. J., and D. L. Yang. 2010. “Minimizing the Total Completion Time in Single-machine Scheduling with Aging/Deteriorating Effects and Deteriorating Maintenance Activities.” Computers & Mathematics with Applications 60 (7): 2161–2169. doi: 10.1016/j.camwa.2010.08.003
   Web of Science ®Google Scholar