Complete local search with limited memory algorithm for no-wait job shops to minimize makespan

DOI10.1016/j.ejor.2008.09.015zbMath1163.90519OpenAlexW2000777806MaRDI QIDQ1026757

Jie Zhu, Qian Wang, Xiao-Ping Li

Publication date: 29 June 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.09.015

zbMATH Keywords

sequencingtimetablingjob shopno-wait

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Total completion time with makespan constraint in no-wait flowshops with setup times ⋮ Scheduling of a job-shop problem with limited output buffers ⋮ Optimal job insertion in the no-wait job shop ⋮ An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time ⋮ A survey of scheduling problems with no-wait in process ⋮ Heuristics for no-wait flowshops with makespan subject to mean completion time

Cites Work

• Unnamed Item
• A rollout metaheuristic for job shop scheduling problems
• Some no-wait shops scheduling problems: Complexity aspect
• The job shop scheduling problem: Conventional and new solution techniques
• 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
• Surgical case scheduling as a generalized job shop scheduling problem
• No-wait job shop scheduling: tabu search and complexity of subproblems
• An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
• 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
• Modelling and optimization of industrial manufacturing processes subject to no-wait constraints
• Minimizing Makespan in No-Wait Job Shops
• 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