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.005zbMath1348.90302OpenAlexW2041093994MaRDI QIDQ337595
Una Benlic, Bo Peng, Tao Qin, Zhipeng Lü, Yang Wang, Cheng, T. C. Edwin
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
Related Items
A hybrid iterated local search algorithm with adaptive perturbation mechanism by success-history based parameter adaptation for differential evolution (SHADE) ⋮ An effective iterated tabu search for the maximum bisection problem ⋮ An exact algorithm for the bi-objective timing problem ⋮ Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
Cites Work
- Unnamed Item
- Unnamed Item
- Breakout local search for maximum clique problems
- A comparison of lower bounds for the single-machine early/tardy problem
- 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
- Breakout local search for the quadratic assignment problem
- BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS
- AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Tabu Search—Part I
- Tabu Search—Part II
- Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
This page was built for publication: Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling
