An Iterated Local Search heuristic for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times

Autor:	Chris N. Potts, Maria Battarra, Anand Subramanian
Rok vydání:	2014
Předmět:	Mathematical optimization Sequence-dependent setup Job shop scheduling Iterated local search Strategy and Management Computation Tardiness Management Science and Operations Research Completion time Heuristics Industrial and Manufacturing Engineering Scheduling (computing) Mathematics
Zdroj:	International Journal of Production Research. 52:2729-2742
ISSN:	1366-588X 0020-7543
DOI:	10.1080/00207543.2014.883472
Popis:	The single machine total weighted tardiness problem with sequence-dependent setup times (often known as problem ) requires a given set of jobs to be sequenced on a single machine, where a setup time is required before the processing of each job that depends on both the preceding job and the job to be processed next. The goal is to minimise the sum of weighted tardiness, where the tardiness of a job is zero if it is completed by its due date and is equal to its completion time minus its due date otherwise. In this paper, we develop an Iterated Local Search (ILS) heuristic and compare its performance with the state-of-the-art metaheuristic algorithms from the literature. The proposed ILS algorithm obtains high-quality solutions using computation times that is comparable to its competitors.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::b0cb3c4328481362d5b1e8339a56669e https://doi.org/10.1080/00207543.2014.883472 Zobrazit plný text záznamu Plný text ve formátu PDF Plný text ve formátu HTML
Nepřihlášeným uživatelům se plný text nezobrazuje	K zobrazení výsledku je třeba se přihlásit.