References
- Adiri, I., Bruno, J., Frostig, E., & Kan, A. H. G. R. (1989). Single machine flow-time scheduling with a single breakdown. Acta Informatica, 26(7), 679–696.
- Bock, S., Briskorn, D., & Horbach, A. (2012). Scheduling flexible maintenance activities subject to job-dependent machine deterioration. Journal of Scheduling, 15(5), 565–578.
- Dantzig, G. (2016). Linear programming and extensions. Princeton, NJ: Princeton University Press.
- Garey, M. R., & Johnson, D. S. (1979). A guide to the theory of NP-completeness. New York, NY: WH Freemann.
- Graham, R. L. (1969). Bounds on multiprocessing anomalies. SIAM Journal on Applied Mathematics, 17(2), 416–269.
- Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 236–287.
- Grigoriu, L., & Briskorn, D. (2017). Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations. Journal of Scheduling, 20(2), 183–197.
- Huo, Y., Reznichenko, B., & Zhao, H. (2014). Minimizing total weighted completion time with unexpected machine unavailability. Journal of Scheduling, 17(2), 161–172.
- Kacem, I., & Chu, C. (2008). Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period. European Journal of Operational Research, 187(3), 1080–1089.
- Lee, C. Y. (1996). Machine scheduling with an availability constraint. Journal of Global Optimization, 9(3–4), 395–416.
- Lee, C. Y., & Liman, S. D. (1992). Single machine flow-time scheduling with sched- uled maintenance. Acta Informatica, 29(4), 375–382.
- Qi, X. (2007). A note on worst-case performance of heuristics for maintenance scheduling problems. Discrete Applied Mathematics, 155(3), 416–422.
- Qi, X., Chen, T., & Tu, F. (1999). Scheduling the maintenance on a single machine. Journal of the Operational Research Society, 50(10), 1071–1078.