A search space analysis of the job shop scheduling problem

DOI10.1023/A:1018979424002MaRDI QIDQ1290160zbMATH OpenFDO

Authors C. Bierwirth, Herbert Kopfer, Dirk Christian Mattfeld

Publication date 10 June 1999

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1018979424002

zbMATH Keywords

job shop schedulinglocal searchstatistical analysis

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

(19)

• Memetic algorithm timetabling for non-commercial sport leagues.
• An efficient genetic algorithm for job shop scheduling with tardiness objectives.
• Job shop scheduling with beam search
• Deterministic job-shop scheduling: Past, present and future
• Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
• Instance space analysis and algorithm selection for the job shop scheduling problem
• Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
• Depth-first heuristic search for the job shop scheduling problem
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• scientific article; zbMATH DE number 1301850 (Why is no real title available?)
• Problem and Heuristic Space Search Strategies for Job Shop Scheduling
• A new hybrid parallel genetic algorithm for the job-shop scheduling problem
• scientific article; zbMATH DE number 232391 (Why is no real title available?)
• A new dispatching rule based genetic algorithm for the multi-objective job shop problem
• A uniform sampling method for permutation space
• An intensification approach based on fitness landscape characteristics for job shop scheduling problem
• Influence of encoding and neighborhood in landscape analysis and tabu search performance for job shop scheduling problem
• Analysis of the similarities and differences of job-based scheduling problems
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290160)