MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem-Reference-Cited by-同舟云学术

MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem

Published:2022-10 Issue: Volume:146 Page:105862
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Balogh Andrea,Garraffa Michele,O’Sullivan Barry^ORCID,Salassa Fabio

Funder

European Regional Development Fund

Science Foundation Ireland

Publisher

Elsevier BV

Subject

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

Reference43 articles.

1. Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times;Adiri;Nav. Res. Logist. Q.,1982

2. Baptiste, P., Hguny, L.K., 1997. A branch and bound algorithm for the F|no−idle|Cmax. In Proceedings of the International Conference on Industrial Engineering and Production Management, IEPM, Vol. 97. pp. 429–438.

3. A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time;Baraz;European J. Oper. Res.,2008

4. Benders decomposition for the mixed no-idle permutation flowshop scheduling problem;Bektaş;J. Sched.,2020

5. A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle flow-shop scheduling;fang Chen;Swarm Evol. Comput.,2019

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

1. The constrained permutation flowshop problem: An effective two-stage iterated greedy algorithm to minimize weighted tardiness;Swarm and Evolutionary Computation;2024-12

2. Flexible assembly job shop scheduling problem considering reconfigurable machine: A cooperative co-evolutionary matheuristic algorithm;Applied Soft Computing;2024-11

3. An Iterative Greedy Algorithm With Q-Learning Mechanism for the Multiobjective Distributed No-Idle Permutation Flowshop Scheduling;IEEE Transactions on Systems, Man, and Cybernetics: Systems;2024-05

4. A tabu memory based iterated greedy algorithm for the distributed heterogeneous permutation flowshop scheduling problem with the total tardiness criterion;Expert Systems with Applications;2024-03

5. A Systematic Literature Review on No-Idle Flow Shop Scheduling Problem;Operations Research Forum;2024-02-27