Two simulated annealing-based heuristics for the job shop scheduling problem-Reference-Cited by-同舟云学术

Two simulated annealing-based heuristics for the job shop scheduling problem

Published:1999-11 Issue:3 Volume:118 Page:524-548
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Steinhöfel K.,Albrecht A.,Wong C.K.

Publisher

Elsevier BV

Subject

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

Reference50 articles.

1. E.H.L. Aarts, Local Search in Combinatorial Optimization. Wiley, New York, 1998

2. E.H.L. Aarts, J.H.M. Korst, Simulated Annealing and Boltzmann Machines: A Stochastic Approach. Wiley, New York, 1989

3. A computational study of local search algorithms for shop scheduling;Aarts;ORSA Journal on Computing,1994

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

5. Optimal placements of flexible objects (Part I: The unbounded case);Albrecht;IEEE Transactions on Computers,1997

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

1. Enhanced Integrated Method of Distributed Scheduling and Simulation for Highly-Distributed Flexible Job Shops;Journal of Smart Processing;2023-11-10

2. A hybrid genetic algorithm for stochastic job-shop scheduling problems;RAIRO - Operations Research;2023-07

3. Mathematical Modelling and Heuristic Approaches to Job-shop Scheduling Problem with Conveyor-based Continuous Flow Transporters;Computers & Operations Research;2022-12

4. Discrete Artificial Algae Algorithm for solving Job-Shop Scheduling Problems;Knowledge-Based Systems;2022-11

5. A theoretical framework to accelerate scheduling improvement heuristics using a new longest path algorithm in perturbed DAGs;International Journal of Production Research;2022-01-10