Two-Stage Hybrid Flowshop Scheduling Problem with Independent Setup Times

Abstract

In this paper, a two-stage hybrid flowshop scheduling problem with independent setup times is examined. The complexity of the studied problem is NP-Hard in the strong sense since it generalized the two-stage hybrid flowshop scheduling problem. Several real-life problems in different areas are modelled using the addressed problem, as in parallel computing and manufacturing processes. Solving the current scheduling problem necessitates the construction of adequate algorithms, providing nearoptimal solutions within a satisfactory computing time. In this study, a genetic algorithm with specific features and three other heuristics are developed. These three heuristics are based on the optimal solution of the parallel machine scheduling problem with release dates and delivery times. In order to assess the performance of the meta-heuristic and the heuristics, a family of three lower bounds is proposed. An exhaustive numerical study is performed over a total of 1920 test problems. The obtained results provide strong evidence of the efficiency and the performance of the proposed procedures.

Supply Chain Risk Prioritization Using AHP and Framework Development: A Perspective of the Automotive Industry

“…The decision-maker then decides their priorities in the pairwise correlational matrix using an integer ranging from 1-9 or their reciprocals respectively. If a selected priority is compared with itself, it is marked as '1' the numbers 3, 5, 7, and 9 denote moderate, strong, very strong, and extreme judgments respectively, and numbers 2, 4, 6, and 8 show an intermediate selection between two odd values of moderate, strong, very strong and extreme [51]. The marking or selection scheme is briefly explained in the table below:…”

Real time read-frequency optimization for railway monitoring system

“…The algorithms used in several different scheduling problems can be utilized to expand and enhance the studied problem [1,5,7,20,22,23,27,28].…”

A Matheuristic Approach for the No-Wait Flowshop Scheduling Problem with Makespan Criterion

“…, , T T T .Then the evolution process can be seen in Figure 8. The indices of points (1, 2), (3,4), (10,11) in the sequence are respectively recorded as 1 2 3…”

“…Production scheduling can meet that need, so it is used in manufacturing systems extensively. Considering the differences in factory conditions and job processing requirements, the scheduling problem has been divided into several kinds, such as flow shop [1,2], hybrid flow shop [3,4], job shop [5,6], open shop [7,8], and so on. The flow shop problem (FSP) claims that each job should be processed in the same order through every stage, and the hybrid flow shop refers to parallel machines at one or more stages.…”