An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach

DOI10.1016/j.cor.2004.09.009zbMath1126.90023OpenAlexW2033755244MaRDI QIDQ2496019

Christoph J. Schuster, Jose M. Framinan

Publication date: 30 June 2006

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

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS ⋮ Feasible insertions in job shop scheduling, short cycles and stable sets ⋮ A proposal for a hybrid meta-strategy for combinatorial optimization problems ⋮ A survey of scheduling problems with no-wait in process ⋮ An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops ⋮ Complete local search with limited memory algorithm for no-wait job shops to minimize makespan

Cites Work

• Unnamed Item
• The job shop scheduling problem: Conventional and new solution techniques
• A branch and bound algorithm for the job-shop scheduling problem
• 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
• Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
• Complexity of Scheduling Shops with No Wait in Process
• 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
• Computational Complexity of Discrete Optimization Problems
• A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Modelling and optimization of industrial manufacturing processes subject to no-wait constraints
• A new approach to computing optimal schedules for the job-shop scheduling problem
• 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
• An effective hybrid optimization strategy for job-shop scheduling problems

This page was built for publication: An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach