کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
420944 | 684008 | 2007 | 24 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: A survey of scheduling with controllable processing times A survey of scheduling with controllable processing times](/preview/png/420944.png)
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.
Journal: Discrete Applied Mathematics - Volume 155, Issue 13, 15 August 2007, Pages 1643–1666