Pre-Emptive Scheduling Problems with Controllable Processing Times

  title={Pre-Emptive Scheduling Problems with Controllable Processing Times},
  author={Natalia V. Shakhlevich and Vitaly A. Strusevich},
  journal={J. Scheduling},
We consider a range of single machine and identical parallel machine pre-emptive scheduling models with controllable processing times. For each model we study a single criterion problem to minimize the compression cost of the processing times subject to the constraint that all due dates should be met. We demonstrate that each single criterion problem can be formulated in terms of minimizing a linear function over a polymatroid, and this justifies the greedy approach to its solution. A unified… CONTINUE READING


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


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

Some simple scheduling algorithms,

W A.
Naval Res. Logist. Quart., • 2002
View 8 Excerpts
Highly Influenced

Minimizing the Weighted Number of Tardy Task Units

Discrete Applied Mathematics • 1994
View 4 Excerpts
Highly Influenced

An Algorithm for Large Zero-One Knapsack Problems

Operations Research • 1980
View 7 Excerpts
Highly Influenced

Scheduling jobs with controllable processing times as an optimalcontrol problem

S. Zdrzalka
Int . J . Contr . • 1984
View 7 Excerpts
Highly Influenced

Operations Management: A Supply Chain Approach, International Thomson Publishing

D. L. Waller
machine,” Oper. Res., • 1999
View 1 Excerpt

Similar Papers

Loading similar papers…