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...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & operations research Vol. 70; pp. 115 - 126
Main Authors:	Gonçalves, Tomás C., Valente, Jorge M.S., Schaller, Jeffrey E.
Format:	Journal Article
Language:	English
Published:	New York Elsevier Ltd 01.06.2016 Pergamon Press Inc
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!