A tabu search method guided by shifting bottleneck for the job shop scheduling problem-Reference-Cited by-同舟云学术

A tabu search method guided by shifting bottleneck for the job shop scheduling problem

Published:2000-01 Issue:2 Volume:120 Page:297-310
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Pezzella Ferdinando,Merelli Emanuela

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. E. Aarts, J.K. Lenstra, Local Search and Combinatorial Optimization, Wiley, New York, 1997

2. The shifting bottleneck procedure for job shop scheduling;Adams;Management Science,1988

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

4. Machine sequencing via disjunctive graph: An implicit enumeration algorithm;Balas;Operations Research,1969

5. E. Balas, A. Vazacopoulos, Guided local search with shifting bottleneck for job shop scheduling, Tech. Rep., Management Science Research Report MSRR-609, GSIA Carnegie Mellon University, Pittsburgh, 1994

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

1. Exploring the evolution of machine scheduling through a computational approach;Engineering Applications of Artificial Intelligence;2024-07

2. A Self-Adaptive Memetic Algorithm for Distributed Job Shop Scheduling Problem;Mathematics;2024-02-26

3. Application of quantum approximate optimization algorithm to job shop scheduling problem;European Journal of Operational Research;2023-10

4. Switching strategy-based hybrid evolutionary algorithms for job shop scheduling problems;Journal of Intelligent Manufacturing;2022-04-16

5. Job Shop Scheduling Problem Optimization by Means of Graph-Based Algorithm;Applied Sciences;2021-02-22