A note on optimal policies for two group scheduling problems with deteriorating setup and processing times

Authors:
Wen-Chiung Lee;Chin-Chia Wu
Affiliations:
Department of Statistics, Feng Chia University, 100 Wenhua Road, Taichung, Taiwan;Department of Statistics, Feng Chia University, 100 Wenhua Road, Taichung, Taiwan
Venue:
Computers and Industrial Engineering
Year:
2010

Citing 5
Cited 1

Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
Scheduling deteriorating jobs on a single processor

Operations Research
Complexity of scheduling tasks with time-dependent execution times

Information Processing Letters
Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine

Computers and Operations Research
Single machine group scheduling under decreasing linear deterioration

Journal of Applied Mathematics and Computing

Deteriorating job scheduling to minimize the number of late jobs with setup times

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Conventionally, job processing times are known and fixed. However, there are many situations where the job processing time deteriorates as time passes. In this note, we consider the makespan problems under the group technology with deteriorating setup and processing times. That is, the job processing times and group setup times are linearly increasing (or decreasing) functions of their starting times. For both linear functions, we show that the makespan problems remain polynomially solvable. In addition, the constructive algorithms are also provided.