Abstract
We propose an iterated local search based on a multi-type perturbation (ILS-MP) approach for single-machine scheduling to minimize the sum of linear earliness and quadratic tardiness penalties. The multi-type perturbation mechanism in ILS-MP probabilistically combines three types of perturbation strategies, namely tabu-based perturbation, construction-based perturbation, and random perturbation. Despite its simplicity, experimental results on a wide set of commonly used benchmark instances show that ILS-MP performs favourably in comparison with the current best approaches in the literature.
| Original language | English |
|---|---|
| Pages (from-to) | 81-88 |
| Number of pages | 8 |
| Journal | Computers and Operations Research |
| Volume | 61 |
| DOIs | |
| Publication status | Published - 1 Sept 2015 |
Keywords
- Iterated local search
- Multi-type perturbation
- Single machine
- Tabu search
ASJC Scopus subject areas
- General Computer Science
- Modelling and Simulation
- Management Science and Operations Research