Adjustment of heads and tails for the job-shop problem-Reference-Cited by-同舟云学术

Adjustment of heads and tails for the job-shop problem

Published:1994-10 Issue:2 Volume:78 Page:146-161
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Carlier J.,Pinson E.

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. The Shifting Bottleneck Procedure for job-shop scheduling;Adams;Management Science,1988

2. A computational study of job-shop scheduling;Applegate;ORSA Journal of Computing,1990

3. Scheduling the general job shop;Barker;Management Science,1985

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

5. Job shop scheduling: A comparison of three enumeration schemes in a branch and bound approach;Bouma,1982

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

1. Algorithms to compute the energetic lower bounds of the cumulative scheduling problem;Annals of Operations Research;2023-10-04

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

3. SCHEDULING OPTIMIZATION IN AN ACTUAL JOB-SHOP;Proceeding of Flexible Automation and Integrated Manufacturing 1996;2023

4. Learning-based Selection process for Branch and Bound Algorithms;2022 IEEE Congress on Evolutionary Computation (CEC);2022-07-18

5. Industrial-size job shop scheduling with constraint programming;Operations Research Perspectives;2022