No-wait flexible flowshop with uniform parallel machines and sequence-dependent setup time: a hybrid meta-heuristic approach

Abstract

According to the state of the art of no-wait scheduling problem, practitioners have mostly concentrated on pure no-wait flow shop scheduling problem. In the most real world production cases, flow shops operate with uniform parallel machines at each stage to eliminate or reduce the bottleneck stages with aim of enhancing the efficiency of production. This paper deals with a no-wait scheduling problem considering anticipatory sequence-dependent setup times on the flexible flow shop environment with uniform parallel machines. The objective is to find the sequence which minimizes maximum completion time of jobs (i.e. makespan). Since this problem is known to be NP-hard, we introduce a novel approach to tackle the problem. In the solution approach, firstly a heuristic formulation is used for objective function evaluation. Afterwards, principles of meta-heuristic algorithms namely invasive weed optimization, variable neighborhood search and simulated annealing algorithms are hybridized as solution method of the problem. In addition, a Taguchi method is employed for calibration of parameters and operators of the proposed hybrid metaheuristic. Various computational experiments in two scales of small and large are established to illustrate the effectiveness

Multiobjective Order Acceptance and Scheduling on Unrelated Parallel Machines with Machine Eligibility Constraints

“…It inserts the gene in position One issue of parthenogenetic operation is how to compose these genetic operators. Insertion and swap are two of the most widely used neighbourhood structures in scheduling [21,22]; thus, to keep a pure insertion or swap operation, gene shift operator and gene exchange operator are totally executed at most once in one genetic operation. Furthermore, to maintain the diversity, if neither gene shift operator nor gene exchange operator is executed, gene inverse operator must be applied.…”

Solving no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines and rework time by the adjusted discrete Multi Objective Invasive Weed Optimization and fuzzy dominance approach

“…In this algorithm, the permutation of jobs is first determined using an innovative approach and another innovative approach based on the well-known NEH approach is then used to initialize the harmony memory. Ramezani, Rabiee and Jolai (2015) studied the no-wait flow shop with uniform parallel machines. They considered sequence-dependent setup time constraint in each stage.…”

A bi-objective simulation-optimization approach for solving a no-wait two stages flexible flow shop scheduling problem with rework ability

“…The result revealed the advantages of our algorithm. To reduce makespan, Ramezani et al (2013) suggested no-wait scheduling problem focused on set up time which is anticipatory and also sequence dependent in a flexible flow shop environment with two sets of same machines in parallel. They introduced it as a novel method since it was NP-hard.…”