Scheduling algorithms for multi-stage flow shops with reworks under overlapped queue time limits

Kim, Hyeon-Il; Lee, Dong-Ho

doi:10.1080/00207543.2022.2139004

Cited by 3 publications

(1 citation statement)

References 54 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…See Su, 26 Ham et al, 27 Yu et al, 28 Wang et al, 29 Lee, 30 Han and Lee, 31 Jeong et al, 32 and Li and Dai 33 for other studies on two-stage flow shops. Also, see Chen and Yang, 34 Ham, 35 Klemmt and Mo¨nch, 36 Wang et al, 37 and Kim and Lee 38 for extensions to multi-stage flow shops.…”

Section: Introductionmentioning

confidence: 99%

A scheduling mechanism for hybrid flow shops with reworks under general queue time limits

Cho¹,

Kim

et al. 2023

Proceedings of the Institution of Mechanical Engineers, Part B:

Self Cite

View full text Add to dashboard Cite

This study addresses multi-stage hybrid flow shop scheduling in which a job is reworked if the queue time between two arbitrary stages exceeds an upper limit. The problem is to determine the allocations of jobs to machines at each stage and the start times of jobs and rework setups/operations when incurred. A mixed integer programming model is proposed for each of the makespan and the total tardiness measures. Then, because the problem is NP-hard, a scheduling mechanism is proposed that consists of three phases: (a) filtering the jobs to be delayed; (b) searching the jobs to be reworked; and (c) dispatching non-delayed and delayed jobs sequentially. Simulation results show that the mechanism proposed in this study outperforms the conventional dispatching approach in the high rework setup time case for the makespan problem and low/high setup time cases for the tardiness problem. The best priority rules of the mechanism under each of the measures are also reported.

show abstract