Article ID: | iaor20002092 |
Country: | United States |
Volume: | 46 |
Issue: | 8 |
Start Page Number: | 893 |
End Page Number: | 911 |
Publication Date: | Dec 1999 |
Journal: | Naval Research Logistics |
Authors: | Bianco Lucio, Speranza Maria Grazia, Giordani Stefano, Dell'Olmo Paolo |
We study the problem of multimode scheduling tasks on dedicated processors, with the objective of minimizing the maximum completion time. Each task can be undertaken in one among a set of predefined alternative modes, where each mode specifies a required set of dedicated processors and a processing time. At any time each processor can be used by a single task at most. General precedence constraints exist among tasks, and task preemption is not allowed. The problem consists of assigning a mode and a starting time to each task, respecting processor and precedence constraints, to minimize the time required to complete all tasks. The problem is