Swarm Intelligent Algorithm For Re-entrant Hybrid Flow shop Scheduling Problems

12/09/2018
by   Zhonghua Han, et al.
0

In order to solve Re-entrant Hybrid Flowshop (RHFS) scheduling problems and establish simulations and processing models, this paper uses Wolf Pack Algorithm (WPA) as global optimization. For local assignment, it takes minimum remaining time rule. Scouting behaviors of wolf are changed in former optimization by means of levy flight, extending searching ranges and increasing rapidity of convergence. When it comes to local extremum of WPA, dynamic regenerating individuals with high similarity adds diversity. Hanming distance is used to judge individual similarity for increased quality of individuals, enhanced search performance of the algorithm in solution space and promoted evolutionary vitality.A painting workshop in a bus manufacture enterprise owns typical features of re-entrant hybrid flowshop. Regarding it as the algorithm applied target, this paper focus on resolving this problem with LDWPA (Dynamic wolf pack algorithm based on Levy Flight). Results show that LDWPA can solve re-entrant hybrid flowshop scheduling problems effectively.

READ FULL TEXT
research
12/07/2018

Research on Limited Buffer Scheduling Problems in Flexible Flow Shops with Setup Times

In order to solve the limited buffer scheduling problems in flexible flo...
research
05/11/2022

Efficient Antenna Optimization Using a Hybrid of Evolutionary Programing and Particle Swarm Optimization

In this paper, we present a hybrid of Evolutionary Programming (EP) and ...
research
10/04/2012

Intelligent Search Heuristics for Cost Based Scheduling

Nurse scheduling is a difficult optimization problem with multiple const...
research
01/08/2014

Variations on Memetic Algorithms for Graph Coloring Problems

Graph vertex coloring with a given number of colors is a well-known and ...
research
04/12/2013

A Novel Metaheuristics To Solve Mixed Shop Scheduling Problems

This paper represents the metaheuristics proposed for solving a class of...
research
03/08/2011

Climbing depth-bounded adjacent discrepancy search for solving hybrid flow shop scheduling problems with multiprocessor tasks

This paper considers multiprocessor task scheduling in a multistage hybr...
research
08/20/2021

Order assignment and picking station scheduling for multiple stations in KIVA warehouses

The picking efficiency of warehouses assisted by KIVA robots benefit fro...

Please sign up or login with your details

Forgot password? Click here to reset