Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems
From MaRDI portal
Publication:6657887
DOI10.1007/s10951-024-00822-zMaRDI QIDQ6657887
Pascale Bendotti, Philippe Chrétienne, Luca Brunod-Indrigo, Bruno Escoffier
Publication date: 7 January 2025
Published in: Journal of Scheduling (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities
- Resource leveling in a machine environment
- NP-complete scheduling problems
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- An effective heuristic for project scheduling with resource availability cost
- Optimal project duration for resource leveling
- Resource levelling for projects with schedule-dependent time windows
- Scheduling chain-structured tasks to minimize makespan and mean flow time
- Mixed-integer linear programming for resource leveling problems
- A common approximation framework for early work, late work, and resource leveling problems
- An updated survey of variants and extensions of the resource-constrained project scheduling problem
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- A metaheuristic solution approach for the time-constrained project scheduling problem
- Optimal scheduling for two-processor systems
- TWO THEOREMS IN GRAPH THEORY
- Two-Processor Scheduling with Start-Times and Deadlines
- `` Strong NP-Completeness Results
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimal Sequencing of Two Equivalent Processors
- Minimizing Resource Availability Costs in Time-Limited Project Networks
This page was built for publication: Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems
