The complexity of scheduling jobs in repetitive manufacturing systems-Reference-Cited by-同舟云学术

The complexity of scheduling jobs in repetitive manufacturing systems

Published:1993-11 Issue:3 Volume:70 Page:350-364
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Kamoun H.,Sriskandarajah C.

Publisher

Elsevier BV

Subject

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

Reference32 articles.

1. Scheduling under resource constraints — deterministic models;Blacewicz,1986

2. On the dominance of k-periodic schedules in cyclic scheduling;Carlier,1990

3. Lot sizing in cyclic scheduling;Claver,1987

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

5. A solvable cyclic scheduling problem with serial precedence structure;Garfinkel;Operations Research,1980

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

1. A Deep Reinforcement Learning-based Rescheduling Method for Flexible Job Shops under Machine Breakdowns;2024 27th International Conference on Computer Supported Cooperative Work in Design (CSCWD);2024-05-08

2. Declarative Models of Periodic Distribution Processes;Lecture Notes in Mechanical Engineering;2022

3. UAVs’ Dynamic Routing, Subject to Time Windows Variation;IFAC-PapersOnLine;2022

4. Declarative Modeling for Multimodal Processes Driven Distribution Networks;Translational Systems Sciences;2022

5. A reactive scheduling method for disturbances in aircraft moving assembly line;International Journal of Production Research;2020-06-03