Single-processor scheduling with time restrictions
From MaRDI portal
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
Cites work
Cited in
(9)- On the NP-hardness of scheduling with time restrictions
- Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions
- A note on 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)