Nature-inspired swarm metaheuristics become one of the most powerful methods for optimization. In discrete optimization, the efficiency of an algorithm depends on how it is adapted to the problem. This paper aims to provide a discretization of the Firefly Algorithm (FF) for the scheduling of a specific manufacturing system, which is the mono processors two-stage hybrid flow shop (HFS). This kin...

This paper investigates scheduling heuristics to seek the minimum of a positively weighted convex sum of makespan and the number of tardy jobs in a hybrid flow shop environment where at least one production stage is made up of unrelated parallel machines. Sequence-and machine-dependent setup times are considered. The problem is a combinatorial optimization problem which is difficult to be solve...

This study investigates the coordination of production scheduling and maintenance planning in theflow shop scheduling environment. The problem is considered in a bi-objective form, minimizing themakespan as the production scheduling criterion and minimizing the system unavailability as themaintenance planning criterion. The time interval between consecutive maintenance activities as well as the...

The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many real world applications. Given its importance and complexity, the HFS problem has been intensively studied. This paper presents a literature review on exact, heuristic and metaheuristic methods that have been proposed f...

In this paper the flow shop scheduling problem with minimizing two criteria simultaneously is consider. Selected criteria are: makespan and the sum of tardiness of jobs. For each separate criteria the problem is strongly NP-hard, which makes it NP-hard as well. There is a number of heuristic algorithms to solve the flow shop problem with various single objectives, but heuristics for multi-crite...

This paper addresses the multistage hybrid flow shop (HFS) scheduling problems. The HFS is the special case of flowshop problem. Multiple parallel machines are considered in each stage in the HFS. The HFS scheduling problem is known to be strongly NPhard. Hence, many researchers proposed metaheuristic algorithms for solving the HFS scheduling problems. This paper develops a bat algorithm (BA) t...

The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A proportionate flexible flow shop (PFFS) is a machine environment with parallel identical machines at each stage. This study presents an effective hybrid approach based on constructive genetic algorithm (CGA) for PFFS sch...

A flexible flow shop problem can be considered as a generalization of a pure flow shop problem in which the jobs have to go through the stages in the same order. We consider a flexible flow shop problem with unrelated machines and setup times, where the processing times depend on the chosen machine and setup times are sequence-dependent. While for classical problems the processing times for eac...

Production scheduling is the process of allocating the resources and then sequencing of task to produce goods. Allocation and sequencing decision are closely related and it is very difficult to model mathematical interaction between them. The allocation problem is solved first and its results are supplied as inputs to the sequencing problem. High quality scheduling improves the delivery perform...

This paper addresses the Hybrid Flow Shop (HFS) scheduling problems to minimize the total work-in-process inventory. Job scheduling problems are one of the oldest and real world combinational optimization problems. It is multi objective and complex in nature. There exist some criteria that must be taken into consideration when evaluating the quality of the proposed schedule. Consideration of jo...