A multi-objective iterated local search algorithm for comprehensive energy-aware hybrid flow shop scheduling

2019 ◽  
Vol 224 ◽  
pp. 421-434 ◽  
Author(s):  
Sven Schulz ◽  
Janis S. Neufeld ◽  
Udo Buscher
Keyword(s):  
Local Search ◽  
Flow Shop ◽  
Search Algorithm ◽  
Iterated Local Search ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Local Search Algorithm ◽  
Energy Aware ◽  
Shop Scheduling ◽  
Hybrid Flow Shop Scheduling

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.

Sign in / Sign up

Export Citation Format

Share Document