Better permutations for the single-processor scheduling with time restrictions
From MaRDI portal
Publication:523167
DOI10.1007/s11590-016-1038-0zbMath1367.90057OpenAlexW2407409100MaRDI QIDQ523167
An Zhang, Feilang Ye, Guangting Chen, Yong Chen
Publication date: 20 April 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-016-1038-0
Related Items
On the NP-hardness of scheduling with time restrictions, On the minimum number of resources for a perfect schedule, EPTAS for parallel identical machine scheduling with time restrictions, The single-processor scheduling problem with time restrictions: complexity and related problems
Cites Work
- Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions
- Single-processor scheduling with time restrictions
- Operating room planning and scheduling: Solving a surgical case sequencing problem
- Operating room planning and scheduling: a literature review
- Scheduling subject to resource constraints: Classification and complexity
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
- Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study
- Handbook on Scheduling
- Unnamed Item