Fast neighborhood search for the single machine earliness-tardiness scheduling problem

DOI10.1016/J.COR.2009.11.002MaRDI QIDQ2379655zbMATH OpenOpenAlexFDO

Authors S. Kedad-Sidhoum, Francis Sourd

Publication date 19 March 2010

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

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

zbMATH Keywords

earliness-tardinessiterated local searchmachine schedulingneighborhood

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
• Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
• Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups
• Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling
• Optimal timing schedules in earliness-tardiness single machine sequencing

Cites work

• A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
• A recovering beam search algorithm for the single machine just-in-time scheduling problem
• An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
• An improved earliness--tardiness timing algorithm
• An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
• Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
• Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
• Fast neighborhood search for the single machine total weighted tardiness problem
• scientific article; zbMATH DE number 1703885 (Why is no real title available?)
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
• Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
• New exact algorithms for one-machine earliness-tardiness scheduling
• Performance enhancements to tabu search for the early/tardy scheduling problem
• Preemption in single machine earliness/tardiness scheduling
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
• The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions

Cited in

(18)

• A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
• Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
• Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
• Bi-objective single machine scheduling problem with stochastic processing times
• Learning variable neighborhood search for a scheduling problem with time windows and rejections
• A linear programming-based method for job shop scheduling
• Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
• Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
• Hybridization of harmony search with variable neighborhood search for restrictive single-machine earliness/tardiness problem
• Two very large-scale neighborhoods for single machine scheduling
• Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling
• Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups
• Recent progress of local search in handling the time window constraints of the vehicle routing problem
• Recent progress of local search in handling the time window constraints of the vehicle routing problem
• Variable neighborhood search for the single machine scheduling problem to minimize the total early work
• Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment
• A weighted distribution-free model for parallel machine scheduling with uncertain job processing times

This page was built for publication: Fast neighborhood search for the single machine earliness-tardiness scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379655)