Premium
Scheduling tasks with sequence‐dependent processing times
Author(s) -
Bianco Lucio,
Ricciardelli Salvatore,
Rinaldi Giovanni,
Sassano Antonio
Publication year - 1988
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(198804)35:2<177::aid-nav3220350203>3.0.co;2-v
Subject(s) - sequence (biology) , scheduling (production processes) , computer science , upper and lower bounds , single machine scheduling , algorithm , job shop scheduling , mathematical optimization , mathematics , schedule , mathematical analysis , genetics , biology , operating system
In this article we consider the problem of minimizing the maximum completion time of a sequence of n jobs on a single machine. Nonzero ready times and sequence‐dependent processing times are allowed. Upper bounds, lower bounds, and dominance criteria are proposed and exploited in a branch‐and‐bound algorithm. Computational results are given.