Considerations of single-machine scheduling with deteriorating jobs

• Published in: Applied mathematical modelling Vol. 35; no. 10; pp. 5134 - 5142
• Main Authors: Zhao, Chuan-Li, Hsu, Chou-Jung, Yang, Dar-Li
• Format: Journal Article
• Language: English
• Published: Kidlington Elsevier Inc 01.10.2011; Elsevier
• Subjects: Applied sciences; Completion time; Deteriorating jobs; Deterioration; Deviation; Exact sciences and technology; Inventory control, production control. Distribution; Mathematical analysis; Mathematical models; Mathematical programming; Operational research and scientific management; Operational research. Management science; Optimization; Resource allocation; Scheduling; Scheduling, sequencing; Single-machine; Single-machine; Scheduling; Deteriorating jobs; Resource allocation; Task scheduling; Makespan; Polynomial method; Due date; Workload; Polynomial time; Deterioration; Resource constraint; Earliness; Objective function; Resource management; Single machine; Completion time
• ISSN: 0307-904X
• DOI: 10.1016/j.apm.2011.04.018

This paper considers some scheduling problems with deteriorating jobs. The objectives are to minimize the makespan, the total completion time, the total absolute deviation of completion time, the earliness, tardiness, and due date penalty, the sum of earliness penalties subject to no tardy jobs, respectively. We also explore two resource constrained scheduling problems: how to minimize the resource consumption with makespan constraints and how to minimize the makespan with the total resource consumption constraints. Several polynomial time algorithms are proposed to optimally solve the problems with the above objective functions.