A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime-Reference-Cited by-同舟云学术

A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime

Published:2016-11 Issue: Volume:61 Page:290-301
ISSN:0957-4174
Container-title:Expert Systems with Applications
language:en
Short-container-title:Expert Systems with Applications

Author:

Fernandez-Viagas Victor^ORCID,Leisten Rainer,Framinan Jose M.

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Science Applications,General Engineering

Reference60 articles.

1. An improved hs algorithms for the blocking flow shop scheduling problems;Bao;Proceedings - 2012 International Conference on Computer Science and Information Processing, CSIP 2012,2012

2. A discrete artificial bee colony algorithm for minimizing the total flow time in the blocking flow shop scheduling;Deng;Chinese Journal of Chemical Engineering,2012

3. An improved NEH-based heuristic for the permutation flowshop problem;Dong;Computers & Operations Research,2008

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

5. Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness;Fernandez-Viagas;Computers & Operations Research,2015

Cited by 41 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. Accelerated evaluation of blocking flowshop scheduling with total flow time criteria using a generalized critical machine-based approach;European Journal of Operational Research;2024-10

3. Theoretical analysis and methods of rapid evaluation: Solving the blocking flowshop group scheduling problem with the total flow time and total tardiness time criteria;Swarm and Evolutionary Computation;2024-07

4. A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time;Journal of Project Management;2024

5. Improvement artificial bee colony meta-heuristic for solving manufacturing flow-shop scheduling problem under blocking constraint;2023 14th International Conference on Intelligent Systems: Theories and Applications (SITA);2023-11-22