No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis.

One of the most widely studied problems in flow shop scheduling is not allowing jobs to wait to be processed at the next stage. This constraint causes the job to be processed immediately at the next stage without waiting, so this problem is popularly called the No-Wait Flow Shop. This article aims to provide a comprehensive review of the No-Wait Flow Shop Scheduling (NWFS) problem based on a survey of published articles from 1999 to 2023. The article review is based on a systematic literature review, and bibliometric analysis is also presented based on the network processed using VOSviewer. One hundred twenty articles were collected from the Scopus database, which was reviewed based on NWFS variants, objective functions, and optimization procedures. The no-wait permutation flow shop scheduling (NWPFS) problem is a variant that researchers have widely investigated. Meta-heuristic procedures are widely applied to solve NWFS problems. In addition, the objective function of minimizing makespan is an objective function that researchers often apply. NWFS research gaps and future research trends are also presented in this paper. [ABSTRACT FROM AUTHOR]