A Note on “Two new approaches for a two-stage hybrid flowshop problem with a single batch processing machine under waiting time constraint”

Huang, Zewen; Shi, Zhongshun; Zhang, Cheng; Shi, Leyuan

doi:10.1016/j.cie.2017.04.010

Cited by 9 publications

(1 citation statement)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Due to the complexity of the general case, most studies are done for the restrictive case. 23,[39][40][41][42][43][44][45][46] Unlike theses, Klemmt and Mo¨nch 36 proposed heuristics that minimize the total tardiness for the general case.…”

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:

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

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:

View full text Add to dashboard Cite

show abstract

Minimising total weighted completion time on batch and unary machines with incompatible job families

Huang

Shi

2018

International Journal of Production Research

View full text Add to dashboard Cite

A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time

Dai

2019

Engineering Optimization

View full text Add to dashboard Cite

A Note on “Two new approaches for a two-stage hybrid flowshop problem with a single batch processing machine under waiting time constraint”

Cited by 9 publications

References 1 publication

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

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

Minimising total weighted completion time on batch and unary machines with incompatible job families

A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time

Contact Info

Product

Resources

About