A new model for the preemptive earliness-tardiness scheduling problem
From MaRDI portal
Publication:1013402
DOI10.1016/j.cor.2008.08.018zbMath1158.90354OpenAlexW2043693499MaRDI QIDQ1013402
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
Related Items
A multi-objective optimization for preemptive identical parallel machines scheduling problem, A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem, Multimode preemptive resource investment problem subject to due dates for activities: formulation and solution procedure, JIT-transportation problem and its algorithm, A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem
Cites Work
- 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
- Single-machine scheduling with early and tardy completion costs
- Optimal timing schedules in earliness-tardiness single machine sequencing
- Scheduling with target start times
