On the minimum number of resources for a perfect schedule

DOI10.1007/s10100-022-00803-7OpenAlexW4281552537WikidataQ114228507 ScholiaQ114228507MaRDI QIDQ6100682

Rachid Benmansour, Oliver Braun

Publication date: 22 June 2023

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-022-00803-7

zbMATH Keywords

mixed integer linear programmingsingle-processor schedulingminimizing the number of resourcesperfect schedule

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions
• Single-processor scheduling with time restrictions
• Better permutations for the single-processor scheduling with time restrictions
• Parallel machine scheduling problems with a single server
• On the NP-hardness of scheduling with time restrictions
• The single-processor scheduling problem with time restrictions: complexity and related problems
• Parallel Machine Scheduling: Impact of Adding Extra Machines

This page was built for publication: On the minimum number of resources for a perfect schedule