Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling
type: Item
instance of: scholarly article
title: Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling
zbMATH Open document ID: 1348.90302
author: Tao Qin
author: Bo Peng
author: Una Benlic
author: Zhipeng Lü
author: Yang Wang
author: T. C. Edwin Cheng
published in: Computers \& Operations Research
publication date: 2016-11-10T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6650894
zbMATH Keywords: single machine
zbMATH Keywords: iterated local search
zbMATH Keywords: multi-type perturbation
zbMATH Keywords: tabu search
MaRDI profile type: Publication
full work available at URL: j.cor.2015.03.005
OpenAlex ID: W2041093994
cites work: Breakout local search for maximum clique problems
cites work: Breakout local search for the quadratic assignment problem
cites work: One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Q4055377
cites work: Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
cites work: Q4452897
cites work: Minimizing the sum of squares lateness on a single machine
cites work: A comparison of lower bounds for the single-machine early/tardy problem
cites work: AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES
cites work: BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS
cites work: A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
DOI: 10.1016/J.COR.2015.03.005
description: scientific article; zbMATH DE number 6650894