Openshop and flowshop scheduling to minimize sum of completion times-Reference-Cited by-同舟云学术

Openshop and flowshop scheduling to minimize sum of completion times

Published:1984-01 Issue:3 Volume:11 Page:275-284
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Adiri I,Amit N

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference9 articles.

1. Scheduling the open shop to minimize mean flow time;Achugbue,1979

2. I. Adiri and D. Pohoryles, Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times. Op. Res., Stat. and Econ. Mimeograph Series No. 263, Fac. of Ind. Engng & Mgmt., Technion. Naval Res. Logistics Quart. (To appear).

3. The complexity of flowshop and jobshop scheduling;Garey;Math. Ops Res.,1976

4. N. Hefetz and I. Adiri, The influence of missing operations on scheduling problems. Oper. Res. Stat. and Econ. Mimeograph Series No. 237, Fac. of Ind. Engng & Mgmt., Technion. Naval Res. Logistics Quart. (To appear).

5. Sequencing by Enumerative Methods;Lenstra,1977

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

1. No-Wait Open-Shop Scheduling Problems with Reverse Flows;Journal of Engineering Research;2024-02

2. Open shop scheduling games;European Journal of Operational Research;2021-11

3. General Open Shop Scheduling;International Series in Operations Research & Management Science;2021-10-31

4. Cooperative Supply Chain Scheduling;International Series in Operations Research & Management Science;2021-10-20

5. Four decades of research on the open-shop scheduling problem to minimize the makespan;European Journal of Operational Research;2021-03