`Strong'-`weak' precedence in scheduling: extensions to series-parallel orders
From MaRDI portal
Publication:602755
DOI10.1016/j.dam.2010.06.015zbMath1198.90176OpenAlexW2031053758MaRDI QIDQ602755
Publication date: 5 November 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.06.015
Partial orders, general (06A06) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling chains to minimize mean flow time
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
- On finding the jump number of a partial order by substitution decomposition
- Chains and trees: `Strong' -- `weak' order in job scheduling
- Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment
- Tree precedence in scheduling: The strong-weak distinction
- New results on the completion time variance minimization
- Scheduling chain-structured tasks to minimize makespan and mean flow time
- Single machine scheduling and due date assignment under series-parallel precedence constraints
- Optimal scheduling for two-processor systems
- Sequencing with Series-Parallel Precedence Constraints
- Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- `` Strong NP-Completeness Results
- Scheduling Opposing Forests
- Scheduling independent tasks to reduce mean finishing time
- REAL-TIME DISPATCHING: SCHEDULING STABILITY AND PRECEDENCE
- Optimal Sequencing of Two Equivalent Processors
This page was built for publication: `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders
