Single machine scheduling with precedence constraints and positionally dependent processing times

DOI10.1016/J.COR.2010.06.004zbMATH Open1251.90135OpenAlexW2072126390MaRDI QIDQ1762097FDOQ1762097

Authors: Alexandre Dolgui, V. A. Strusevich, V. 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

Recommendations

• Single-machine scheduling with precedence constraints and position-dependent processing times
• Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
• Precedence constrained parallel-machine scheduling of position-dependent jobs
• Schedules with precedence restrictions and position-dependent servicing durations
• Single machine scheduling with decreasing linear deterioration under precedence constraints

zbMATH Keywords

learningschedulingdeteriorationprecedence constraintspositionally dependent processing time

Mathematics Subject Classification ID

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

Cites Work

• A survey of scheduling with controllable processing times
• Title not available (Why is that?)
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Title not available (Why is that?)
• A state-of-the-art review on scheduling with learning effects
• Incremental modular decomposition
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• A concise survey of scheduling with time-dependent processing times
• Scheduling with time dependent processing times: Review and extensions
• 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
• Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
• Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
• Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
• Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
• Sequencing with Series-Parallel Precedence Constraints
• A Fast Algorithm for the Decomposition of Graphs and Posets
• Efficient and practical algorithms for sequential modular decomposition
• Optimal strategies for a class of constrained sequential problems
• Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
• Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions
• Scheduling in a contaminated area: a model and polynomial algorithms
• On finding the jump number of a partial order by substitution decomposition
• Single machine scheduling and due date assignment under series-parallel precedence constraints
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs
• Title not available (Why is that?)

Cited In (15)

• Title not available (Why is that?)
• Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
• Integer Programming and Combinatorial Optimization
• Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
• Title not available (Why is that?)
• Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
• Precedence constrained parallel-machine scheduling of position-dependent jobs
• single Machine Preemptive Scheduling With Special Cost Functions¹
• Single-Machine Scheduling with Precedence Constraints
• Minmax scheduling problems with common due-date and completion time penalty
• Single-machine scheduling with precedence constraints and position-dependent processing times
• Schedules with precedence restrictions and position-dependent servicing durations
• Parametric precedence relations in single machine scheduling
• Single-machine scheduling problems with time and position dependent processing times
• Single machine scheduling with a generalized job-dependent cumulative effect

This page was built for publication: Single machine scheduling with precedence constraints and positionally dependent processing times

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