Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling
From MaRDI portal
Publication:337595
DOI10.1016/J.COR.2015.03.005zbMATH Open1348.90302OpenAlexW2041093994MaRDI QIDQ337595FDOQ337595
Authors: Tao Qin, Bo Peng, Una Benlic, Zhipeng Lü, Yang Wang, T. C. Edwin Cheng 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.03.005
Recommendations
- Fast neighborhood search for the single machine earliness-tardiness scheduling problem
- Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness
- scientific article; zbMATH DE number 1703885
- ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness
- An iterated local search algorithm for the lot-streaming flow shop scheduling problem
Cites Work
- Tabu Search—Part I
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tabu Search—Part II
- Breakout local search for the quadratic assignment problem
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
- Minimizing the sum of squares lateness on a single machine
- BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS
- Breakout local search for maximum clique problems
- AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES
- Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
- A comparison of lower bounds for the single-machine early/tardy problem
Cited In (7)
- Title not available (Why is that?)
- An effective iterated tabu search for the maximum bisection problem
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
- An exact algorithm for the bi-objective timing problem
- Fast neighborhood search for the single machine earliness-tardiness scheduling problem
- A hybrid iterated local search algorithm with adaptive perturbation mechanism by success-history based parameter adaptation for differential evolution (SHADE)
- Hybridization of harmony search with variable neighborhood search for restrictive single-machine earliness/tardiness problem
This page was built for publication: Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337595)
