An improved earliness--tardiness timing algorithm

DOI10.1016/j.cor.2005.11.004zbMath1185.90077OpenAlexW2080789149MaRDI QIDQ878565

Yann Hendel, Francis Sourd

Publication date: 26 April 2007

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

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

zbMATH Keywords

schedulingearliness--tardinesstiming algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Fast neighborhood search for the single machine earliness-tardiness scheduling problem, Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows, An exact algorithm for the bi-objective timing problem, Just-in-time single-batch-processing machine scheduling, Learning variable neighborhood search for a scheduling problem with time windows and rejections, Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence, Recent progress of local search in handling the time window constraints of the vehicle routing problem, Multicriteria models for just-in-time scheduling, Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date, Recent progress of local search in handling the time window constraints of the vehicle routing problem, A multi-agent system for the weighted earliness tardiness parallel machine problem, Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs, The one-machine just-in-time scheduling problem with preemption, A new model for the preemptive earliness-tardiness scheduling problem, A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems, Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates

Cites Work

• Unnamed Item
• A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
• An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions
• Optimal timing of a sequence of tasks with general completion costs
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
• PERT scheduling with convex cost functions.
• Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
• Minimizing the earliness--tardiness costs on a single machine
• A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Isotonic Median Regression: A Linear Programming Approach
• Single-machine scheduling with early and tardy completion costs
• Optimal timing schedules in earliness-tardiness single machine sequencing
• An exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem