Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops-Reference-Cited by-同舟云学术

Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops

Published:2009-02 Issue:1 Volume:56 Page:113-120
ISSN:0360-8352
Container-title:Computers & Industrial Engineering
language:en
Short-container-title:Computers & Industrial Engineering

Author:

Choi Hyun-Seon,Lee Dong-Ho

Publisher

Elsevier BV

Subject

General Engineering,General Computer Science

Reference22 articles.

1. A flexible flow shop problem with total flow time minimization;Azizoglu;European Journal of Operational Research,2001

2. Tardiness minimization on parallel machines;Azizoglu;International Journal of Production Economics,1998

3. Branch and bound algorithm for the flow shop with multiple processors;Brah;European Journal of Operational Research,1991

4. Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at on stage;Chen;Journal of the Operational Research Society,1995

5. A branch and bound algorithm for two-stage hybrid flow shops: Minimizing the number of tardy jobs;Choi;Journal of the Korean Institute of Industrial Engineers,2007

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

1. Scheduling analysis of automotive glass manufacturing systems subject to sequence-independent setup time, no-idle machines, and permissive maximum total tardiness constraint;Engineering Applications of Artificial Intelligence;2024-07

2. Improved Simulated Annealing Algorithm for the Scheduling of Hybrid Flow-shop Problem;2022 3rd International Conference on Computer Vision, Image and Deep Learning & International Conference on Computer Engineering and Applications (CVIDL & ICCEA);2022-05-20

3. A green model for identical parallel machines scheduling problem considering tardy jobs and job splitting property;Sustainable Operations and Computers;2022

4. An improved gravitational search algorithm to the hybrid flowshop with unrelated parallel machines scheduling problem;International Journal of Production Research;2020-07-09

5. A multi-start variable neighbourhood descent algorithm for hybrid flowshop rescheduling;Swarm and Evolutionary Computation;2019-03