`Strong'-`weak' precedence in scheduling: extensions to series-parallel orders

DOI10.1016/J.DAM.2010.06.015MaRDI QIDQ602755zbMATH OpenOpenAlexFDO

Authors Moshe Dror, George Steiner

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

zbMATH Keywords

posetsschedulingstrong and weak precedence

Mathematics Subject Classification ID

Partial orders, general (06A06) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Chains and trees: `Strong' -- `weak' order in job scheduling
• Tree precedence in scheduling: The strong-weak distinction
• Single Machine Scheduling with Series-Parallel Precedence Constraints
• scientific article; zbMATH DE number 3883928
• scientific article; zbMATH DE number 3894817

Cites work

• `` Strong NP-Completeness Results
• Chains and trees: `Strong' -- `weak' order in job scheduling
• Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
• Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment
• scientific article; zbMATH DE number 3730169 (Why is no real title available?)
• scientific article; zbMATH DE number 3744543 (Why is no real title available?)
• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• scientific article; zbMATH DE number 6157240 (Why is no real title available?)
• New results on the completion time variance minimization
• On finding the jump number of a partial order by substitution decomposition
• Optimal scheduling for two-processor systems
• Optimal Sequencing of Two Equivalent Processors
• REAL-TIME DISPATCHING: SCHEDULING STABILITY AND PRECEDENCE
• Scheduling chain-structured tasks to minimize makespan and mean flow time
• Scheduling chains to minimize mean flow time
• Scheduling independent tasks to reduce mean finishing time
• Scheduling Opposing Forests
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Sequencing with Series-Parallel Precedence Constraints
• Single machine scheduling and due date assignment under series-parallel precedence constraints
• Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
• Tree precedence in scheduling: The strong-weak distinction

Cited in

(4)

• Chains and trees: `Strong' -- `weak' order in job scheduling
• Tree precedence in scheduling: The strong-weak distinction
• Minimum equivalent precedence relation systems
• Ranking chain sum orders

This page was built for publication: `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders

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