A Lot Streaming Model for a Re-entrant Flow Shop Scheduling Problem with Missing Operations

2015 ◽  
pp. 149-158
Author(s):  
Richard Hinze
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Lot Streaming ◽  
Shop Scheduling

A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem

2011 ◽  
Vol 181 (12) ◽  
pp. 2455-2468 ◽  
Author(s):  
Quan-Ke Pan ◽  
M. Fatih Tasgetiren ◽  
P.N. Suganthan ◽  
T.J. Chua
Keyword(s):  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Lot Streaming ◽  
Shop Scheduling ◽  
Bee Colony ◽  
Streaming Flow

Discrete Particle Swarm Optimization Algorithm for Lot-Streaming No-Wait Flow Shop Scheduling Problem

2012 ◽  
Vol 538-541 ◽  
pp. 863-868 ◽  
Author(s):  
Lin Yang ◽  
Yu Xia Pan
Keyword(s):  
Particle Swarm Optimization ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Discrete Particle Swarm Optimization ◽  
Lot Streaming ◽  
Swarm Optimization ◽  
Discrete Particle ◽  
Shop Scheduling ◽  
No Wait

This paper proposed discrete particle swarm optimization(DPSO) algorithm to solve lot-streaming no-wait flow shop scheduling problem(LNFSP) with the objective of the maximum completion time. The natural encoding scheme based on job permutation and newly-designed methods were adopted to produce new individuals . After the DPSO-based exploration, a efficient fast local search based on swap neighborhood structure is used to enhance the exploitation capability. Simulation results show the effectiveness of the proposed algorithms.

Sign in / Sign up

Export Citation Format

Share Document