Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
type: Item
instance of: scholarly article
title: Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
zbMATH Open document ID: 1163.90519
author: Jie Zhu
author: Qian Wang
author: Xiaoping Li
published in: European Journal of Operational Research
publication date: 2009-06-29T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5571300
zbMATH Keywords: no-wait
zbMATH Keywords: job shop
zbMATH Keywords: timetabling
zbMATH Keywords: sequencing
MaRDI profile type: Publication
full work available at URL: j.ejor.2008.09.015
OpenAlex ID: W2000777806
cites work: A Computational Study of the Job-Shop Scheduling Problem
cites work: Minimizing Makespan in No-Wait Job Shops
cites work: The job shop scheduling problem: Conventional and new solution techniques
cites work: Surgical case scheduling as a generalized job shop scheduling problem
cites work: An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
cites work: Tabu Search—Part II
cites work: Sequencing of jobs in some production system
cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
cites work: Deterministic job-shop scheduling: Past, present and future
cites work: Computational Complexity of Discrete Optimization Problems
cites work: Modelling and optimization of industrial manufacturing processes subject to no-wait constraints
cites work: Job-shop scheduling with blocking and no-wait constraints
cites work: A rollout metaheuristic for job shop scheduling problems
cites work: Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
cites work: A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
cites work: A Scheduling Problem*
cites work: Complexity of Scheduling Shops with No Wait in Process
cites work: Approximative procedures for no-wait job shop scheduling.
cites work: Q3585709
cites work: No-wait job shop scheduling: tabu search and complexity of subproblems
cites work: Some no-wait shops scheduling problems: Complexity aspect
cites work: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
cites work: Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
DOI: 10.1016/J.EJOR.2008.09.015
Recommended article: Some local search algorithms for no-wait flow-shop problem with makespan criterion
Recommended article: Q3585709
Recommended article: An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
Recommended article: Efficient local search algorithms for job-shop scheduling problems
Recommended article: A Computational Study of Local Search Algorithms for Job Shop Scheduling
Recommended article: A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights
Recommended article: Q4343739
Recommended article: Q4851825
Recommended article: Minimizing Makespan in No-Wait Job Shops
description: scientific article; zbMATH DE number 5571300