On the minimum number of resources for a perfect schedule

DOI10.1007/S10100-022-00803-7OpenAlexW4281552537WikidataQ114228507 ScholiaQ114228507MaRDI QIDQ6100682FDOQ6100682

Authors: R. Ben-Mansour, 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

Recommendations

• Minimizing mean flow time with parallel processors and resource constraints
• Nearly optimal perfectly-periodic schedules
• scientific article; zbMATH DE number 1859291
• Scheduling of resource tasks
• Single-processor scheduling with time restrictions

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
• Parallel machine scheduling problems with a single server
• The single-processor scheduling problem with time restrictions: complexity and related problems
• Better permutations for the single-processor scheduling with time restrictions
• Parallel Machine Scheduling: Impact of Adding Extra Machines
• On the NP-hardness of scheduling with time restrictions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6100682)