A search space analysis of the job shop scheduling problem
From MaRDI portal
Publication:1290160
DOI10.1023/A:1018979424002zbMATH Open0921.90093MaRDI QIDQ1290160FDOQ1290160
Herbert Kopfer, C. Bierwirth, Dirk Christian Mattfeld
Publication date: 10 June 1999
Published in: Annals of Operations Research (Search for Journal in Brave)
Recommendations
- Problem and Heuristic Space Search Strategies for Job Shop Scheduling
- Job Shop Scheduling by Local Search
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- scientific article; zbMATH DE number 1031416
Cited In (16)
- Problem difficulty for tabu search in job-shop scheduling
- Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- A uniform sampling method for permutation space
- An efficient genetic algorithm for job shop scheduling with tardiness objectives.
- A new hybrid parallel genetic algorithm for the job‐shop scheduling problem
- Memetic algorithm timetabling for non-commercial sport leagues.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
- A new dispatching rule based genetic algorithm for the multi-objective job shop problem
- Problem and Heuristic Space Search Strategies for Job Shop Scheduling
- An intensification approach based on fitness landscape characteristics for job shop scheduling problem
- Depth-first heuristic search for the job shop scheduling problem
- Job shop scheduling with beam search
- Deterministic job-shop scheduling: Past, present and future
This page was built for publication: A search space analysis of the job shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290160)
