Openshops with jobs overlap-Reference-Cited by-同舟云学术

Openshops with jobs overlap

Published:1993-12 Issue:3 Volume:71 Page:366-378
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Wagneur E.,Sriskandarajah C.

Publisher

Elsevier BV

Subject

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

Reference12 articles.

1. Scheduling Under Resource Constraints-Deterministic Models;Blazewicz,1986

2. Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop;French,1982

3. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979

4. Optimization and approximation in deterministic sequencing and scheduling: A survey;Graham;Annals of Discrete Mathematics,1979

5. A note on the complexity of openshop scheduling problems;Kubiak;INFOR,1991

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

1. New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: A computational evaluation;Computers & Operations Research;2024-12

2. Coordination of the decentralized concurrent open-shop;IISE Transactions;2022-03-28

3. A differential evolution algorithm for the customer order scheduling problem with sequence-dependent setup times;Expert Systems with Applications;2022-03

4. A size-reduction algorithm for the order scheduling problem with total tardiness minimization;Journal of Project Management;2022

5. Minimizing total tardiness for the order scheduling problem with sequence-dependent setup times using hybrid matheuristics;International Journal of Industrial Engineering Computations;2022