Two-machine flowshop scheduling in a physical examination center

Wang, Yadong; Fan, Baoqiang; Zhai, Jingang; Wei, Xicheng

doi:10.1007/s10878-017-0233-y

Cited by 4 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reference [28] further improved the solution quality to the two-machine scheduling problem with time constraints in a reasonable computational time. Most recently, [29] analyzed the complexities involved in the scheduling problems with release time constraints in a service application area. From the limited studies of flowshop scheduling problems with time constraints, reference [30] was the first to address permutation flowshop scheduling with release times.…”

Section: Introductionmentioning

confidence: 99%

Improved Beam Search for Optimizing No-Wait Flowshops With Release Times

et al. 2020

View full text Add to dashboard Cite

Production management of perishable goods is highly complex and requires well-informed decisions in corresponding stages. In such production environments, scheduling problems with time constraints are of high relevance to ensure the timely flow of the work-in-process material and goods. This study introduces the no-wait flowshop scheduling problem with release times (NWFSP-RT) to help advance decision support systems in the food production industry. For this purpose, an original mixed-integer linear programming (MILP) formulation is proposed for minimizing the makespan. Since Beam Search (BS) algorithm has been successfully applied to solve various scheduling problems, a BS algorithm, and an improved variant, the local search-based Beam Search (BSLS) algorithms are developed to solve the NWFSP-RT problem. Extensive numerical analysis is conducted to analyze the performance of the algorithms in solving this highly intractable extension of the scheduling problems. We showed that BSLS effectively avoids early convergence and local optimality while dismissing non-promising search directions within a partial enumeration solution approach. The statistical analysis confirmed that the improved BS algorithm performs better in terms of solution quality. Applications of the developed heuristic are worthwhile research topics to pursue in solving other complex optimization problems. INDEX TERMS Flowshop scheduling, no-wait, release time, Beam Search.

show abstract

Section: Introductionmentioning

confidence: 99%