Tight Bounds for Restricted Grid Scheduling
- 30 April 2019
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 30 (03) , 375-405
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Natur og Univers, Det Frie Forskningsråd (DFF-1323-00247)
- Villum Fonden (VKR023219)
- Velux Fonden (Visiting Professor)
- Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada
This publication has 8 references indexed in Scilit:
- Online variable-sized bin packing with conflictsDiscrete Optimization, 2011
- A new variable-sized bin packing problemJournal of Scheduling, 2010
- Scheduling Jobs on Grid ProcessorsAlgorithmica, 2008
- More on online bin packing with two item sizesDiscrete Optimization, 2008
- A new version of on-line variable-sized bin packingDiscrete Applied Mathematics, 1997
- Competitive snoopy cachingAlgorithmica, 1988
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- A lower bound for on-line bin packingInformation Processing Letters, 1980