A survey of scheduling with controllable processing times

  title={A survey of scheduling with controllable processing times},
  author={Dvir Shabtay and George Steiner},
  journal={Discrete Applied Mathematics},
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… CONTINUE READING
Highly Influential
This paper has highly influenced 12 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 89 extracted citations

A two-machine jobshop scheduling problem with convex processing times

2018 13th IEEE Conference on Industrial Electronics and Applications (ICIEA) • 2018
View 5 Excerpts
Highly Influenced

A tabu-search algorithm for two-machine flow-shop with controllable processing times

2014 IEEE Symposium on Computational Intelligence for Engineering Solutions (CIES) • 2014
View 5 Excerpts
Highly Influenced


Publications referenced by this paper.
Showing 1-10 of 110 references

Common due date assignment for scheduling on a single machine with jointly reducible processing times

D. Biskup, H. Jahnke
Internat. J. Production Econom. 69 • 2001
View 8 Excerpts
Highly Influenced

Two parallel machine sequencing problems involving controllable job processing times

B. Alidaee, A. Ahmadian
European J. Oper. Res. 70 • 1993
View 7 Excerpts
Highly Influenced


T.C.E. Cheng
Shakhlevich, Two-machine open shop problem with controllable processing times • 2006
View 9 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…