Discrepancy search for the flexible job shop scheduling problem
From MaRDI portal
Publication:991381
DOI10.1016/J.COR.2010.03.009zbMath1231.90176OpenAlexW2023444009MaRDI QIDQ991381
Marie-José Huguet, Mohamed Haouari, Pierre Lopez, 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
Related Items (11)
A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times ⋮ An integrated search heuristic for large-scale flexible job shop scheduling problems ⋮ Path-relinking tabu search for the multi-objective flexible job shop scheduling problem ⋮ Genetic tabu search for the fuzzy flexible job shop problem ⋮ A neural network algorithm for servicing jobs with sequential and parallel machines ⋮ Adaptive multimeme algorithm for flexible job shop scheduling problem ⋮ Weight-based heuristics for constraint satisfaction and combinatorial optimization problems ⋮ Flexible job shop scheduling with blockages ⋮ Operating room surgery scheduling with fuzzy surgery durations using a metaheuristic approach ⋮ A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities ⋮ A research survey: review of flexible job shop scheduling techniques
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
This page was built for publication: Discrepancy search for the flexible job shop scheduling problem