Scheduling problems with partially ordered jobs

DOI10.1134/S0005117910100036zbMath1203.93127MaRDI QIDQ612206

Alexandre Dolgui, Valery S. Gordon

Publication date: 3 January 2011

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

schedulingpartially ordered jobs

Mathematics Subject Classification ID

Applications of optimal control and differential games (49N90) Deterministic scheduling theory in operations research (90B35) Control/observation systems involving computers (process control, etc.) (93C83)

Cites Work

• Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
• Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment
• A note on optimal assignment of slack due-dates in single-machine scheduling
• Optimal assignment of due-dates for preemptive single-machine scheduling
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
• Scheduling in a contaminated area: a model and polynomial algorithms
• Single machine scheduling and due date assignment under series-parallel precedence constraints
• Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
• Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions
• Sequencing with Series-Parallel Precedence Constraints
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Scheduling problems with partially ordered jobs