Discrepancy search for the flexible job shop scheduling problem

DOI10.1016/j.cor.2010.03.009zbMath1231.90176MaRDI QIDQ991381

Mohamed Haouari, Pierre Lopez, Marie-José Huguet, Abir Ben Hmida

Publication date: 7 September 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.03.009

zbMATH Keywords

scheduling; allocation; flexible job shop; neighborhood structures; discrepancy search

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Weight-based heuristics for constraint satisfaction and combinatorial optimization problems

Cites Work

• Unnamed Item
• Parallel machine scheduling with precedence constraints and setup times
• Job-shop scheduling with multi-purpose machines
• Tabu search for the job-shop scheduling problem with multi-purpose machines
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
• Effective neighbourhood functions for the flexible job shop problem
• Routing and scheduling in a flexible job shop by tabu search
• A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
• A genetic algorithm for the flexible job-shop scheduling problem
• The Complexity of Flowshop and Jobshop Scheduling
• Variable neighborhood search: Principles and applications