A new model for the preemptive earliness-tardiness scheduling problem

DOI10.1016/j.cor.2008.08.018zbMath1158.90354MaRDI QIDQ1013402

Francis Sourd, Nina Runge

Publication date: 17 April 2009

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

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

zbMATH Keywords

scheduling; earliness-tardiness; local search; lower bound; preemption; timing algorithm

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

JIT-transportation problem and its algorithm, A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem, A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Preemption in single machine earliness/tardiness scheduling
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• An improved earliness--tardiness timing algorithm
• On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
• The one-machine problem with earliness and tardiness penalties
• Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
• Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
• The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions
• A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
• Scheduling with target start times