A very difficult scheduling problem with communication delays


Hoogeveen, Han and Woeginger, Gerhard J. (2001) A very difficult scheduling problem with communication delays. Operations Research Letters, 29 (5). pp. 241-245. ISSN 0167-6377

[img] PDF
Restricted to UT campus only
: Request a copy
Abstract:A set of unit-time tasks has to be processed on an unrestricted number of processors subject to precedence constraints and unit-time communication delays such that the makespan is minimized. What is the smallest number m* such that increasing the number of processors beyond m* cannot decrease the makespan any more?
Item Type:Article
Copyright:© 2001 Elsevier
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/74417
Official URL:https://doi.org/10.1016/S0167-6377(01)00103-1
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 203192