A note on single-machine scheduling with decreasing time-dependent job processing times

• Published in: Applied mathematical modelling Vol. 34; no. 2; pp. 294 - 300
• Main Author: Wang, Ji-Bo
• Format: Journal Article
• Language: English
• Published: Kidlington Elsevier Inc 01.02.2010; Elsevier
• Subjects: Applied sciences; Exact sciences and technology; Operational research and scientific management; Operational research. Management science; Resource allocation; Scheduling; Scheduling, sequencing; Single-machine; Time-dependent processing times; Single-machine; Scheduling; Time-dependent processing times; Resource allocation; Minimization; Processing time; Modeling; Time dependence; Earliness; Resource management; Single machine; Completion time; Execution time
• ISSN: 0307-904X
• DOI: 10.1016/j.apm.2009.04.018

In this note we consider some single-machine scheduling problems with decreasing time-dependent job processing times. Decreasing time-dependent job processing times means that its processing time is a non-increasing function of its execution start time. We present polynomial solutions for the sum of squared completion times minimization problem, and the sum of earliness penalties minimization problem subject to no tardy jobs, respectively. We also study two resource constrained scheduling problems under the same decreasing time-dependent job processing times model and present algorithms to find their optimal solutions.