TY - JOUR
T1 - A survey of scheduling with controllable processing times
AU - Shabtay, Dvir
AU - Steiner, George
N1 - Funding Information:
This research was partially supported by the Paul Ivanier Center for Robotics and Production Management, Ben-Gurion University of the Negev. Partial support by the Natural Sciences and Engineering Research Council of Canada under Grant no. 041798 is also gratefully acknowledged.
PY - 2007/8/15
Y1 - 2007/8/15
N2 - In classical deterministic scheduling problems, the job processing times are assumed to be constant parameters. In many practical cases, however, processing times are controllable by allocating a resource (that may be continuous or discrete) to the job operations. In such cases, each processing time is a decision variable to be determined by the scheduler, who can take advantage of this flexibility to improve system performance. Since scheduling problems with controllable processing times are very interesting both from the practical and theoretical point of view, they have received a lot of attention from researchers over the last 25 years. This paper aims to give a unified framework for scheduling with controllable processing times by providing an up-to-date survey of the results in the field.
AB - In classical deterministic scheduling problems, the job processing times are assumed to be constant parameters. In many practical cases, however, processing times are controllable by allocating a resource (that may be continuous or discrete) to the job operations. In such cases, each processing time is a decision variable to be determined by the scheduler, who can take advantage of this flexibility to improve system performance. Since scheduling problems with controllable processing times are very interesting both from the practical and theoretical point of view, they have received a lot of attention from researchers over the last 25 years. This paper aims to give a unified framework for scheduling with controllable processing times by providing an up-to-date survey of the results in the field.
KW - Complexity
KW - Controllable processing times
KW - Deterministic scheduling
KW - Resource allocation
UR - http://www.scopus.com/inward/record.url?scp=34547404222&partnerID=8YFLogxK
U2 - 10.1016/j.dam.2007.02.003
DO - 10.1016/j.dam.2007.02.003
M3 - Article
AN - SCOPUS:34547404222
SN - 0166-218X
VL - 155
SP - 1643
EP - 1666
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
IS - 13
ER -