Minimizing Maximum Tardiness in a Distributed Flow Shop Manufacturing Problem under No-Waiting and Sequence Dependent Setup Time Constraints-Reference-Cited by-同舟云学术

Minimizing Maximum Tardiness in a Distributed Flow Shop Manufacturing Problem under No-Waiting and Sequence Dependent Setup Time Constraints

Published:2023-11-22 Issue: Volume: Page:1-6
ISSN:
Container-title:2023 14th International Conference on Intelligent Systems: Theories and Applications (SITA)
language:
Short-container-title:

Author:

Sayah Achraf¹,Aqil Said²,Lahby Mohamed¹

Affiliation:

1. Hassan II University of Casablanca,Higher Normal School,Laboratory of Applied Mathematics and Computer Sciences,Morocco

2. Hassan II University of Casablanca,National Higher School Of Arts And Crafts,Laboratory Artificial Intelligence and Complex Systems Engineering,Morocco

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/10373588/10373590/10373688.pdf?arnumber=10373688

Reference12 articles.

1. Hybrid Artificial Bee Colony Algorithm for a Parallel Batching Distributed Flow-Shop Problem With Deteriorating Jobs

2. Iterated Greedy methods for the distributed permutation flowshop scheduling problem

3. An Effective Cooperative Co-Evolutionary Algorithm for Distributed Flowshop Group Scheduling Problems

4. An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem

5. The distributed permutation flowshop scheduling problem

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

1. Two Hybrid Heuristic Algorithms for Optimizing Data Processing Schedules in Distributed Edge Computing;2024 11th International Conference on Wireless Networks and Mobile Communications (WINCOM);2024-07-23