Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: a systematic literature review

Abstract

Flow shop scheduling is a type of scheduling where sequence follows for each job on a set of machines for processing. In practice, jobs in flow shops can arrive at irregular times, and the no-wait constraint allows the changes in the job order to flexibly manage such irregularity. The flexible flow shop scheduling problems with no-wait have mainly addressed for flow optimization on the shop floor in manufacturing, processing, and allied industries. The scope of this paper is to identify the literature available on permutation and non-permutation flow shop scheduling with no-wait constraint. This paper organizes scheduling problems based on performance measures of variability and shop environments. The extended summary of two/three-machine and m-machine problems has been compiled, including their objectives, algorithms, parametric considerations, and their findings. A systematic appearance of both conceptual and analytical results summarizes various advances of the no-wait constraint. The paper includes independently investigated problems and suggestions for future research directions.

A Crossbreed Discrete Artificial Bee Colony for Permutation Flow Shop Scheduling Problem to Minimize Total Earliness and Tardiness

“…If jobs 𝑗 within the pth dimension of the 𝜋, we get 𝜑 𝜋 (𝑝) = 𝑗. For example, if job 4 in the dimension of 2nd of the π= [3,4,1,5,2], therefore 𝜑 𝜋 (2) = 4. The difference of food source in traditional ABC for continuous problems, CDABC, and corresponding schedule in CDABC is…”

“…The random number generated is IO (1,5). Then the new solutions resulting from the initial tour with IO are as follows in Fig.…”

“…There are different variants of FSP such as permutation, non-permutation, noidle, nowait, and hybrid flow shop scheduling problems. The latest studies discussing review papers on FSP can be found in [1][2][3][4]. Permutation flow shop scheduling problem (PFSP) becomes the most common issue in obtaining a sequence given n jobs with the same order at m machines to find the objective function [5].…”

A Reinforcement Learning Approach to Robust Scheduling of Permutation Flow Shop

“…Hence, the pursuit of judicious algorithmic design, generating high-quality solutions within acceptable timeframes for practical scenarios, assumes significant research import. Presently, the dominant methodologies for addressing this domain encompass exact algorithms [10], heuristic algorithms [11], metaheuristic algorithms [12,13], and deep reinforcement learning (DRL) algorithms [14]. Nevertheless, the existing mainstream approaches fall short of striking an optimal balance between solution quality and computational time.…”

Polynomial algorithms for some scheduling problems with one nonrenewable resource

“…We can quote the works of Monma and Sidney [16,17] and of Sekiguchi [23]. Flow shop scheduling is a type of scheduling where jobs need to be processed on a set of machines in identical order [25]. In [13], the authors deal with the two-machine flow shop scheduling problem with unlimited periodic and synchronized maintenance applied on both machines.…”