No-wait job shop scheduling: tabu search and complexity of subproblems
From MaRDI portal
Publication:2474557
DOI10.1007/s00186-005-0056-yzbMath1134.90393OpenAlexW2053571513MaRDI QIDQ2474557
Publication date: 6 March 2008
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-005-0056-y
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
The no-wait job shop with regular objective: a method based on optimal job insertion ⋮ Optimal job insertion in the no-wait job shop ⋮ A survey of scheduling problems with no-wait in process ⋮ Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
Cites Work
- Unnamed Item
- A rollout metaheuristic for job shop scheduling problems
- Inapproximability results for no-wait job shop scheduling.
- The job shop scheduling problem: Conventional and new solution techniques
- Reduction of job-shop problems to flow-shop problems with precedence constraints
- A branch and bound algorithm for the job-shop scheduling problem
- A genetic algorithm for flowshop sequencing
- New heuristics for no-wait flowshops to minimize makespan.
- Approximative procedures for no-wait job shop scheduling.
- Sequencing of jobs in some production system
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
- Deterministic job-shop scheduling: Past, present and future
- Job-shop scheduling with blocking and no-wait constraints
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects
- Complexity of Scheduling Shops with No Wait in Process
- Tabu Search—Part I
- Tabu Search—Part II
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- A Computational Study of the Job-Shop Scheduling Problem
- Ordonnancements à contraintes disjonctives
- Disjunctive Programming
- Computational Complexity of Discrete Optimization Problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
- Modelling and optimization of industrial manufacturing processes subject to no-wait constraints
- Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
- A Scheduling Problem*
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
This page was built for publication: No-wait job shop scheduling: tabu search and complexity of subproblems
