An Iterated Local Search Algorithm for the Two-Machine Flow Shop Problem with Buffers and Constant Processing Times on One Machine

2019 ◽  
pp. 50-65 ◽  
Author(s):  
Hoang Thanh Le ◽  
Philine Geser ◽  
Martin Middendorf
Keyword(s):  
Local Search ◽  
Flow Shop ◽  
Search Algorithm ◽  
Iterated Local Search ◽  
Local Search Algorithm ◽  
Processing Times ◽  
Flow Shop Problem ◽  
One Machine

A Parallel Iterated Local Search for Two-Agent Flow Shop Scheduling

2014 ◽  
Vol 926-930 ◽  
pp. 3476-3484 ◽  
Author(s):  
Xiao Qiang Xu ◽  
De Ming Lei
Keyword(s):  
Local Search ◽  
Flow Shop ◽  
Search Algorithm ◽  
Iterated Local Search ◽  
Flow Shop Scheduling ◽  
Local Search Algorithm ◽  
Shop Scheduling ◽  
Transition Mechanism ◽  
Neighborhood Structures ◽  
Agent Flow

In this paper a two-agent flow shop scheduling problem is studied and a simple parallel iterated local search algorithm is proposed to minimize the makespan of jobs from the first agent and the total tardiness of jobs from the second agent simultaneously. Parallelization is implemented by applying multiple independent searches, each of which uses three neighborhood structures with dynamical transition mechanism. The current solution of each independent search is replaced with a solution, which is randomly chosen from the non-dominated set and perturbed. The computational experiments show the promising advantage of the proposed method when compared to other algorithms of the problem.

Iterated Local Search and Other Algorithms for Buffered Two-Machine Permutation Flow Shops with Constant Processing Times on One Machine

2020 ◽  
pp. 1-25
Author(s):  
Hoang Thanh Le ◽  
Philine Geser ◽  
Martin Middendorf
Keyword(s):  
Local Search ◽  
Flow Shop ◽  
Iterated Local Search ◽  
Flow Shop Scheduling ◽  
Np Hard ◽  
Ant Colony Optimization Algorithm ◽  
Solution Quality ◽  
Processing Times ◽  
One Machine ◽  
Special Case

The two-machine permutation flow shop scheduling problem with buffer is studied for the special case that all processing times on one of the two machines are equal to a constant c. This case is interesting because it occurs in various applications, e.g., when one machine is a packing machine or when materials have to be transported. Different types of buffers and buffer usage are considered. It is shown that all considered buffer flow shop problems remain NP-hard for the makespan criterion even with the restriction to equal processing times on one machine. However, the special case where the constant c is larger or smaller than all processing times on the other machine is shown to be polynomially solvable by presenting an algorithm (2BF-OPT) that calculates optimal schedules in [Formula: see text] steps. Two heuristics for solving the NP-hard flow shop problems are proposed: i) a modification of the commonly used NEH heuristic (mNEH) and ii) an Iterated Local Search heuristic (2BF-ILS) that uses the mNEH heuristic for computing its initial solution. It is shown experimentally that the proposed 2BF-ILS heuristic obtains better results than two state-of-the-art algorithms for buffered flow shop problems from the literature and an Ant Colony Optimization algorithm. In addition, it is shown experimentally that 2BF-ILS obtains the same solution quality as the standard NEH heuristic, however, with a smaller number of function evaluations.

Sign in / Sign up

Export Citation Format

Share Document