Resource leveling with subcontracting: algorithms and complexity

DOI10.1007/S10951-025-00861-0MaRDI QIDQ7231662zbMATH OpenFDO

Authors Nicholas G. Hall, Marc E. Posner

Publication date 21 April 2026

Published in Journal of Scheduling (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10951-025-00861-0

zbMATH Keywords

algorithmsproject managementoutsourcingminimizing maximum resource usage

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Geometric algorithms and combinatorial optimization
• Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time
• Minimizing Resource Availability Costs in Time-Limited Project Networks
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Optimization guided lower and upper bounds for the resource investment problem
• Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
• Project scheduling. A research handbook.
• Resource levelling for projects with schedule-dependent time windows
• Scheduling Opposing Forests
• Scheduling chain-structured tasks to minimize makespan and mean flow time
• Scheduling subject to resource constraints: Classification and complexity
• Scheduling with deadlines and loss functions

This page was built for publication: Resource leveling with subcontracting: algorithms and complexity

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