Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs
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 optim...
Saved in:
Published in | Computers & operations research Vol. 32; no. 3; pp. 521 - 536 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Oxford
Elsevier Ltd
01.03.2005
Elsevier Science Pergamon Press Inc |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
ISSN: | 0305-0548 1873-765X 0305-0548 |
DOI: | 10.1016/j.cor.2003.08.001 |