A tabu memory based iterated greedy algorithm for the distributed heterogeneous permutation flowshop scheduling problem with the total tardiness criterion-Reference-Cited by-同舟云学术

A tabu memory based iterated greedy algorithm for the distributed heterogeneous permutation flowshop scheduling problem with the total tardiness criterion

Published:2024-03 Issue: Volume:238 Page:121790
ISSN:0957-4174
Container-title:Expert Systems with Applications
language:en
Short-container-title:Expert Systems with Applications

Author:

Feng Xiaobing^ORCID,Zhao Fei^ORCID,Jiang Gedong,Tao Tao,Mei Xuesong

Funder

National Key Research and Development Program of China

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Science Applications,General Engineering

Reference44 articles.

1. MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem;Balogh;Computers & Operations Research,2022

2. A novel chemical reaction optimization for the distributed permutation flowshop scheduling problem with makespan criterion;Bargaoui;Computers & Industrial Engineering,2017

3. A probability model-based memetic algorithm for distributed heterogeneous flow-shop scheduling;Chen,2019

4. A new constructive heuristic for the Fm—block—ΣT;Companys Pascual,2014

5. A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem;Fernandez-Viagas;International Journal of Production Research,2015

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

1. Self-Adaptive Population-Based Iterated Greedy Algorithm for Distributed Permutation Flowshop Scheduling Problem with Part of Jobs Subject to a Common Deadline Constraint;Expert Systems with Applications;2024-01