Single-processor scheduling with time restrictions
From MaRDI portal
Publication:490336
DOI10.1007/S10951-013-0342-0zbMATH Open1305.68041OpenAlexW2137203481MaRDI QIDQ490336FDOQ490336
Authors: Oliver Braun, Fan Chung, Ron Graham 
Publication date: 22 January 2015
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-013-0342-0
Recommendations
- Better permutations for the single-processor scheduling with time restrictions
- A note on single processor scheduling with time restrictions
- Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions
- On the NP-hardness of scheduling with time restrictions
- The single-processor scheduling problem with time restrictions: complexity and related problems
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
Cited In (8)
- On the NP-hardness of scheduling with time restrictions
- Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions
- The single-processor scheduling problem with time restrictions: complexity and related problems
- Minimization of maximum lateness on parallel machines with a single server and job release dates
- On the minimum number of resources for a perfect schedule
- EPTAS for parallel identical machine scheduling with time restrictions
- Scheduling on a single processor with variable speed
- Better permutations for the single-processor scheduling with time restrictions
This page was built for publication: Single-processor scheduling with time restrictions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490336)
