On the complexity of scheduling unit-time jobs with or-precedence constraints
From MaRDI portal
Publication:813963
DOI10.1016/j.orl.2004.11.009zbMath1082.90037OpenAlexW1967966457MaRDI QIDQ813963
Publication date: 2 February 2006
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15476
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items (7)
A General Framework for Approximating Min Sum Ordering Problems ⋮ The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm ⋮ Machine scheduling with soft precedence constraints ⋮ Polyhedral results for position-based scheduling of chains on a single machine ⋮ Stochastic project scheduling with hierarchical alternatives ⋮ Scheduling of tasks with effectiveness precedence constraints ⋮ Makespan minimization with OR-precedence constraints
Cites Work
- Unnamed Item
- Unnamed Item
- NP-complete scheduling problems
- Some simplified NP-complete graph problems
- Linear preselective policies for stochastic project scheduling
- Profile Scheduling of Opposing Forests and Level Orders
- Scheduling Tasks with Nonuniform Deadlines on Two Processors
- Complexity of Scheduling under Precedence Constraints
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling with AND/OR Precedence Constraints
- Algorithmic approaches to preselective strategies for stochastic scheduling problems
- Scheduling Opposing Forests
- Scheduling Tasks with AND/OR Precedence Constraints
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: On the complexity of scheduling unit-time jobs with or-precedence constraints
