A priority list based heuristic for the job shop problem

DOI10.1057/palgrave.jors.2601481zbMath1095.90556OpenAlexW1986577748MaRDI QIDQ4661108

Paul M. E. Shutler

Publication date: 4 April 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601481

zbMATH Keywords

heuristicsschedulingsimulated annealingtabu search

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem

This page was built for publication: A priority list based heuristic for the job shop problem