Complete local search with limited memory algorithm for no-wait job shops to minimize makespan-Reference-Cited by-同舟云学术

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

Published:2009-10 Issue:2 Volume:198 Page:378-386
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Zhu Jie,Li Xiaoping,Wang Qian

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference27 articles.

1. A computational study of the job-shop problem;Applegate;ORSA Journal on Computing,1991

2. Minimizing makespan in no-wait job shops;Bansal;Mathematics of Operations Research,2005

3. The job-shop-scheduling-problem: Conventional and new solution techniques;Blazewicz;European Journal of Operational Research,1996

4. Surgical case scheduling as a generalized job shop scheduling problem;Dinh-Nguyen;European Journal of Operational Research,2008

5. Probabilistic learning combinations of local job-shop scheduling rules;Fisher,1963

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A simple migrating birds optimization algorithm with two search modes to solve the no-wait job shop problem;Expert Systems with Applications;2024-03

2. A Simple Migrating Birds Optimization Algorithm with Two Search Modes to Solve the No-Wait Job Shop Problem;2023

3. Minimizing total completion time in the no-wait jobshop scheduling problem using a backtracking metaheuristic;Computers & Industrial Engineering;2022-07

4. A cooperative coevolutionary algorithm approach to the no-wait job shop scheduling problem;Expert Systems with Applications;2022-05

5. Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times;Journal of the Operational Research Society;2022-02-27