A batch-oblivious approach for Complex Job-Shop scheduling problems-Reference-Cited by-同舟云学术

A batch-oblivious approach for Complex Job-Shop scheduling problems

Published:2017-11 Issue:1 Volume:263 Page:50-61
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Knopp Sebastian,Dauzère-Pérès Stéphane,Yugma Claude

Publisher

Elsevier BV

Subject

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

Reference46 articles.

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

2. Minimizing total tardiness in parallel machine scheduling with setup times: An adaptive memory-based grasp approach;Armentano;European Journal of Operational Research,2007

3. Test instances for the Flexible Job Shop scheduling problem with work centers;Behnke,2012

4. Scheduling jobs with ready times and precedence constraints on parallel batch machines using metaheuristics;Bilyk;Computers & Industrial Engineering,2014

5. Scheduling algorithms;Brucker,2007

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

1. Solving the project scheduling problem with dependent resource constraints;Journal of Industrial and Production Engineering;2024-08-02

2. A semiconductor wafer manufacturing system scheduling start-up and decision mechanism considering bottleneck drift characteristics;Computers & Industrial Engineering;2024-07

3. Metaheuristics for solving a flexible flow‐shop scheduling problem with s‐batching machines;International Transactions in Operational Research;2024-06-12

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

5. Implementation of Simulation Modeling of Single and High-Volume Machine-Building Productions;Designs;2024-03-08