No-wait flow scheduling hybrid algorithm

Author

Tan, Jin

Author_Institution

Sch. of Electron. & Electr. Eng., Shanghai Second Polytech. Univ., Shanghai, China

fYear

2011

fDate

27-29 June 2011

Firstpage

520

Lastpage

523

Abstract

In this paper, a new Discrete Particle Swarm Optimization (DPSO) algorithms is introduced for bi-objective no-wait flow scheduling problem, to minimize total flow time (TFT) and maximum completion time (makespan). which makes the problem into single objective by sum of weighted and discrete for no-wait flow scheduling problem. In order to improve the optimization of PSO and increase the algorithm´s exploring ability, we can improve the performances through executing Variable Neighborhood Search. Passing through the testing experiments, this hybrid scheduling algorithms has higher superior performance.

Keywords

flow shop scheduling; minimisation; particle swarm optimisation; search problems; DPSO algorithm; TFT; biobjective no-wait flow scheduling problem; discrete particle swarm optimization; maximum completion time; no-wait flow scheduling hybrid algorithm; total flow time; variable neighborhood search; Algorithm design and analysis; Encoding; Genetic algorithms; Optimization; Particle swarm optimization; Scheduling; Scheduling algorithm; Discrete Particle Swarm Optimization; bi-objective optimization; no-wait flow scheduling; objective weighted;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science and Service System (CSSS), 2011 International Conference on

Conference_Location

Nanjing

Print_ISBN

978-1-4244-9762-1

Type

conf

DOI

10.1109/CSSS.2011.5974557

Filename

5974557