Single machine scheduling with precedence constraints and positionally dependent processing times

DOI10.1016/J.COR.2010.06.004MaRDI QIDQ1762097zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

learningschedulingdeteriorationprecedence constraintspositionally dependent processing time

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3825547 (Why is no real title available?)
• scientific article; zbMATH DE number 3906240 (Why is no real title available?)
• scientific article; zbMATH DE number 3683588 (Why is no real title available?)
• scientific article; zbMATH DE number 3691044 (Why is no real title available?)
• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• scientific article; zbMATH DE number 3612753 (Why is no real title available?)
• scientific article; zbMATH DE number 3894817 (Why is no real title available?)
• A Fast Algorithm for the Decomposition of Graphs and Posets
• A concise survey of scheduling with time-dependent processing times
• A note on optimal assignment of slack due-dates in single-machine scheduling
• A state-of-the-art review on scheduling with learning effects
• A survey of scheduling with controllable processing times
• 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
• Efficient and practical algorithms for sequential modular decomposition
• Incremental modular decomposition
• Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
• Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
• On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs
• On finding the jump number of a partial order by substitution decomposition
• Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions
• Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Optimal strategies for a class of constrained sequential problems
• Scheduling in a contaminated area: a model and polynomial algorithms
• Scheduling with time dependent processing times: Review and extensions
• 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
• Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint

Cited in

(15)

• scientific article; zbMATH DE number 1487922 (Why is no real title available?)
• scientific article; zbMATH DE number 6874349 (Why is no real title available?)
• Parametric precedence relations in single machine scheduling
• single Machine Preemptive Scheduling With Special Cost Functions¹
• Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
• Single-Machine Scheduling with Precedence Constraints
• Minmax scheduling problems with common due-date and completion time penalty
• Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
• Single-machine scheduling with precedence constraints and position-dependent processing times
• Single-machine scheduling problems with time and position dependent processing times
• Precedence constrained parallel-machine scheduling of position-dependent jobs
• Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
• Integer Programming and Combinatorial Optimization
• Schedules with precedence restrictions and position-dependent servicing durations
• 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)