A search space analysis of the job shop scheduling problem
From MaRDI portal
Publication:1290160
DOI10.1023/A:1018979424002zbMath0921.90093MaRDI QIDQ1290160
Herbert Kopfer, Christian Bierwirth, Dirk Christian Mattfeld
Publication date: 10 June 1999
Published in: Annals of Operations Research (Search for Journal in Brave)
Related Items (7)
A new dispatching rule based genetic algorithm for the multi-objective job shop problem ⋮ Memetic algorithm timetabling for non-commercial sport leagues. ⋮ An efficient genetic algorithm for job shop scheduling with tardiness objectives. ⋮ Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ A new hybrid parallel genetic algorithm for the job‐shop scheduling problem ⋮ Problem difficulty for tabu search in job-shop scheduling
This page was built for publication: A search space analysis of the job shop scheduling problem
