References
- Cheng, T. C. E., & Ding, Q. (2001). Single machine scheduling with step-deteriorating processing times. European Journal of Operational Research, 134(3), 623–630. https://doi.org/10.1016/S0377-2217(00)00284-8
- Cheng, T. C. E., Kravchenko, S. A., & Lin, B. M. T. (2020). Scheduling step-deteriorating jobs to minimize the total completion time. Computers & Industrial Engineering, 144, 106329. https://doi.org/10.1016/j.cie.2020.106329
- Jeng, A. A. K., & Lin, B. M. T. (2004). Makespan minimization in single-machine scheduling with step-deterioration of processing times. Journal of the Operational Research Society, 55(3), 247–256. https://doi.org/10.1057/palgrave.jors.2601693
- Kim, E.-S., & Oron, D. (2015). Minimizing total completion time on a single machine with step improving jobs. Journal of the Operational Research Society, 66(9), 1481–1490. https://doi.org/10.1057/jors.2014.91
- Kim, H.-J., Kim, E.-S., & Lee, J.-H. (2022). Scheduling of step-improving jobs with an identical improving rate. Journal of the Operational Research Society, 73(5), 1127–1136. https://doi.org/10.1080/01605682.2021.1886616
- Kubiak, W., & van de Velde, S. (1998). Scheduling deteriorating jobs to minimize makespan. Naval Research Logistics, 45(5), 511–523. https://doi.org/10.1002/(SICI)1520-6750(199808)45:5<511::AID-NAV5>3.0.CO;2-6
- Mosheiov, G. (1995). Scheduling jobs with step-deterioration: Minimizing makespan on a single-and multi-machine. Computers & Industrial Engineering, 28(4), 869–879. https://doi.org/10.1016/0360-8352(95)00006-M
- Sundararaghavan, P. S., & Kunnathur, A. S. (1994). Single machine scheduling with start time-dependent processing times: Some solvable cases. European Journal of Operational Research, 78(3), 394–403. https://doi.org/10.1016/0377-2217(94)90048-5
- Smith, W. E. (1956). Various optimizers for single stage production. Naval Research Logistics Quarterly, 3(1-2), 59–66. https://doi.org/10.1002/nav.3800030106
- Woeginger, G. J. (2000). When does a dynamic programming formulation guarantee the existence of an FPTAS? INFORMS Journal on Computing, 12(1), 57–74. https://doi.org/10.1287/ijoc.12.1.57.11901