Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness

Authors:
T. C. E. Cheng;Chou-Jung Hsu;Yi-Chi Huang;Wen-Chiung Lee
Affiliations:
Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Department of Industrial Engineering and Management, Nan Kai Institute of Technology, Taiwan;Department of Statistics, Feng Chia University, Taichung, Taiwan;Department of Statistics, Feng Chia University, Taichung, Taiwan
Venue:
Computers and Operations Research
Year:
2011

Citing 12
Cited 2

Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
Scheduling deteriorating jobs on a single processor

Operations Research
Single-machine group scheduling problems with deterioration consideration

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

Journal of Applied Mathematics and Computing
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint

Computers and Operations Research
A two-machine flowshop makespan scheduling problem with deteriorating jobs

Computers and Industrial Engineering
Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration

Computers & Mathematics with Applications
Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates

Computers and Operations Research
Time-Dependent Scheduling

Time-Dependent Scheduling
Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration

Computers and Operations Research
Single-machine scheduling problems with deteriorating jobs and learning effects

Computers and Industrial Engineering
Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires

Journal of Heuristics

Minimizing maximum tardiness and delivery costs in a batched delivery system

Computers and Industrial Engineering
Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

In many realistic production situations, a job processed later consumes more time than the same job when it is processed earlier. Production scheduling in such an environment is known as scheduling with deteriorating jobs. However, research on scheduling problems with deteriorating jobs has rarely considered explicit (separable) setup time (cost). In this paper, we consider a single-machine scheduling problem with deteriorating jobs and setup times to minimize the maximum tardiness. We provide a branch-and-bound algorithm to solve this problem. Computational experiments show that the algorithm can solve instances up to 1000 jobs in reasonable time.