Online Span Minimization for Flexible Uniform Jobs
Open Access
- 6 July 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 37-49
Abstract
No abstract availableAll Related Versions
Funding Information
- National Science Foundation (2216970 (IDEAL))
- Singapore Ministry of Education Academic Research Fund Tier 1 (RG15/25)
This publication has 16 references indexed in Scilit:
- LP rounding and combinatorial algorithms for minimizing active and busy timeJournal of Scheduling, 2017
- Competitiveness of Dynamic Bin Packing for Online Cloud Server AllocationIEEE/ACM Transactions on Networking, 2016
- Efficient Online Strategies for Renting Servers in the Cloud2015
- A Model for Minimizing Active Processor TimeAlgorithmica, 2013
- Minimizing total busy time in parallel scheduling with application to optical networksTheoretical Computer Science, 2010
- Approximation Algorithms for Wavelength Assignment2005
- Line System Design and a Generalized Coloring Problem2003
- A Fast Algorithm for Multiprocessor Scheduling of Unit-Length JobsSIAM Journal on Computing, 1989
- Scheduling Unit–Time Tasks with Arbitrary Release Times and DeadlinesSIAM Journal on Computing, 1981
- A fast algorithm for multiprocessor scheduling1980