Kang, L.Y., Cheng, T.C.E., Ng, C.T. and Zhao, M. (2005) Scheduling to Minimize Makespan with Time-Dependent Processing Times. Lecture Notes in Computer Science, 3827, 925-933.
https://doi.org/10.1007/11602613_92

has been cited by the following article:

• TITLE: Single Machine Slack Due-Window Assignment and Scheduling of Linear Time-Dependent Deteriorating Jobs and a Deteriorating Maintenance Activity

  AUTHORS: Bo Cheng, Ling Cheng

  KEYWORDS: Deteriorating Job, Due-Window, Maintenance Activity, Scheduling

  JOURNAL NAME: Open Access Library Journal, Vol.5 No.10, October 11, 2018

  ABSTRACT: In this paper, we consider the slack due-window assignment model and study a single machine scheduling problem of linear time-dependent deteriorating jobs and a deteriorating maintenance activity. The objective is to find the job schedule having an assigned maintenance activity and due-windows with the minimum total cost consisting of costs of earliness, tardiness, window location and window size. A polynomial-time algorithm is presented in this paper with time complexity for n jobs.