Metaheuristics for the single machine weighted quadratic tardiness scheduling problem

This paper considers the single machine scheduling problem with weighted quadratic tardiness costs. Three metaheuristics are presented, namely iterated local search, variable greedy and steady-state genetic algorithm procedures. These address a gap in the existing literature, which includes branch-a...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computers & operations research Ročník 70; s. 115 - 126
Hlavní autoři:	Gonçalves, Tomás C., Valente, Jorge M.S., Schaller, Jeffrey E.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Elsevier Ltd 01.06.2016 Pergamon Press Inc
Témata:	Branch & bound algorithms Computation Genetic algorithm Genetic algorithms Heuristic Heuristic methods Iterated local search Iterative methods Mathematical models Metaheuristics Operations research Optimization Production scheduling Quadratic programming Scheduling Searching Single machine Studies Variable greedy Weighted quadratic tardiness Metaheuristics Genetic algorithm Scheduling Variable greedy Weighted quadratic tardiness Single machine Iterated local search
ISSN:	0305-0548, 1873-765X, 0305-0548
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!