Benchmarks for shop scheduling problems-Reference-Cited by-同舟云学术

Benchmarks for shop scheduling problems

Published:1998-08 Issue:1 Volume:109 Page:137-141
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Demirkol Ebru,Mehta Sanjay,Uzsoy Reha

Publisher

Elsevier BV

Subject

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

Reference21 articles.

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

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 graphs: An implicit enumeration approach;Balas;Operations Research,1969

5. One machine scheduling with delayed precedence constraints;Balas;Management Science,1995

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

1. The flexible job shop scheduling problem: A review;European Journal of Operational Research;2024-04

2. Benchmarks for Job Scheduling in Ultra-Distributed Systems;Proceedings of the 1st International Workshop on Middleware for the Computing Continuum;2023-12-11

3. A spatial pyramid pooling-based deep reinforcement learning model for dynamic job-shop scheduling problem;Computers & Operations Research;2023-12

4. Bridging Reinforcement Learning and Planning to Solve Combinatorial Optimization Problems with Nested Sub-Tasks;CAAI Artificial Intelligence Research;2023-12

5. Energy cost efficient scheduling in flexible job-shop manufacturing systems;European Journal of Operational Research;2023-11