A novel encoding scheme of PSO for two-machine group scheduling

Authors:
Cheng-Dar Liou;Chun-Hung Liu
Affiliations:
Department of Business Administration, National Formosa University, Huwei, Yunlin County, Taiwan, ROC;Department of Business Administration, National Formosa University, Huwei, Yunlin County, Taiwan, ROC
Venue:
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
Year:
2010

Citing 4
Cited 0

Two-machine flowshop group scheduling problem

Computers and Operations Research
An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers

Computers and Operations Research
Total flow time minimization in a flowshop sequence-dependent group scheduling problem

Computers and Operations Research
Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the two-machine flow shop group scheduling problem with the transportation times and sequence-dependent setup times considerations The objective is to minimize the total completion time In this paper, a novel encoding scheme of PSO for flow shop group scheduling is proposed to effectively solve various instances with group numbers up to 15 Note that the proposed encoding scheme simultaneously determines the sequence of jobs in each group and the sequence of groups Three different lower bounds are developed to evaluate the performance of the proposed PSO algorithm Limited numerical results show that the proposed PSO algorithm performs well for all test problems.