On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties

DOI10.1016/S0305-0548(02)00194-6zbMath1057.90019DBLPjournals/cor/LauffW04OpenAlexW2003147525WikidataQ57633928 ScholiaQ57633928MaRDI QIDQ1765543

Frank Werner, Volker Lauff

Publication date: 23 February 2005

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

Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00194-6

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Exponential neighborhood search for a parallel machine scheduling problem ⋮ Minimising mean tardiness with alternative operations in two-machine flow-shop scheduling ⋮ Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date ⋮ Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey ⋮ Optimal control algorithms and their analysis for short-term scheduling in manufacturing systems ⋮ Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval ⋮ Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem ⋮ Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations ⋮ A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs

Cites Work

• Equivalence of mean flow time problems and mean absolute deviation problems
• The complexity of scheduling job families about a common due date
• Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
• Minimizing the average deviation of job completion times about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• Minimizing mean absolute deviation of completion times about a common due date
• Single-machine scheduling to minimize absolute deviation of completion times from a common due date
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Optimal flowshop schedules with no intermediate storage space
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties