An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem
From MaRDI portal
Publication:2411179
DOI10.3934/jimo.2017029zbMath1378.90047OpenAlexW2606343952MaRDI QIDQ2411179
Adel Dabah, Abdelhakim AitZai, Ahcene Bendjoudi
Publication date: 20 October 2017
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2017029
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Uses Software
Cites Work
- A rollout metaheuristic for job shop scheduling problems
- The flexible blocking job shop with transfer and set-up times
- A new neighborhood and tabu search for the blocking job shop
- Future paths for integer programming and links to artificial intelligence
- Job-shop scheduling with blocking and no-wait constraints
- Surgical case scheduling as a generalized job shop scheduling problem
- A branch and bound and parallel genetic algorithm for the job shop scheduling problem with blocking
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Job Shop Scheduling by Simulated Annealing
- Tabu Search—Part I
- Tabu Search—Part II
- A Computational Study of the Job-Shop Scheduling Problem
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process