Single machine scheduling with precedence constraints and positionally dependent processing times

DOI10.1016/j.cor.2010.06.004zbMath1251.90135OpenAlexW2072126390MaRDI QIDQ1762097

Vitaly A. Strusevich, Alexandre Dolgui, Valery S. Gordon

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.06.004

zbMATH Keywords

schedulinglearningprecedence constraintsdeteriorationpositionally dependent processing time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items

Minmax scheduling problems with common due-date and completion time penalty ⋮ Single machine scheduling with a generalized job-dependent cumulative effect

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
• Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
• On finding the jump number of a partial order by substitution decomposition
• Optimal strategies for a class of constrained sequential problems
• 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
• A concise survey of scheduling with time-dependent processing times
• A survey of scheduling with controllable processing times
• A state-of-the-art review on scheduling with learning effects
• 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
• Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
• Efficient and Practical Algorithms for Sequential Modular Decomposition
• Scheduling with time dependent processing times: Review and extensions
• A Fast Algorithm for the Decomposition of Graphs and Posets
• Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
• Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions
• Incremental modular decomposition
• Sequencing with Series-Parallel Precedence Constraints
• On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs
• Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints