An Overview of Hybrid Flow Shop Scheduling

Abstract

This paper is survey of hybrid flow shop scheduling problems. An HFS scheduling problem is a classical flow-shop in which parallel machines are available to perform the same operation. Most real world scheduling problems are NP-hard in nature. The hybrid flow shop scheduling problems have received considerable research attention. The several optimization and heuristic solution procedures are available to solve a variety of hybrid flow shop scheduling problems. It discusses and reviews sustainability of several variants of the hybrid flow shop scheduling problem for economical analysis, each in turn considering different assumptions, constraints and objective functions. Sustainability is the long-term maintenance of responsibility, which analysis the economics and encompasses the concept of stewardship. The Hybrid flow shop problem has sustained for several decades with multi – objective constraints. The paper shows some fruitful directions for future research and opportunities in the area of hybrid flow shop.

Optimization of Two-Stage Hybrid Flow Shop Scheduling Problems Using Genetic Algorithm

“…The computational result shows that the SA algorithm yields good quality solution than existing company production sequence result. The hybrid flow shop scheduling problems exhaustive reviewed in sustainability perspective aspects with many constraints and assumptions [12]. The two-stage hybrid flow shop scheduling problems with missing operations considered in stainless steel manufacturing to minimize the makespan time using heuristic approach [13].…”