Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs

Authors:
A. A. K. Jeng;B. M. T. Lin
Affiliations:
Department of Information Management, National Chi Nan University, Pu-Li, Nan-Tou County 545, Taiwan;Department of Information Management, National Chi Nan University, Pu-Li, Nan-Tou County 545, Taiwan
Venue:
Computers and Operations Research
Year:
2005

Citing 7
Cited 2

Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
Scheduling jobs under simple linear deterioration

Computers and Operations Research
Scheduling jobs with step-deterioration; minimizing makespan on a single- and multi-machine

Computers and Industrial Engineering
Single machine scheduling with deadlines and increasing rates of processing times

Acta Informatica
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs

Computers and Operations Research
A note on single-processor scheduling with time-dependent execution times

Operations Research Letters

Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs

Computers and Operations Research
A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration

Advances in Engineering Software

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we study a scheduling problem of minimizing the total completion time on a single machine where the processing time of a job is a step function of its starting time and a due date that is common to all jobs. This problem has been shown to be NP-hard in the literature. To derive optimal solutions from a practical aspect, we develop a lower bound and two elimination rules to design branch-and-bound algorithms. Through computational experiments, we show that the proposed properties are effective in curtailing unnecessary explorations during the solution-finding process, and that the synergy of these properties can solve problems with up to 100 jobs in a few seconds.