DocumentCode
1923367
Title
A Bio-Inspired Algorithm for Solving the Scheduling Problems with Redundant Molds
Author
Hong, Tzung-Pei ; Chien, Ting-I ; Lee, Yeong-Chyi ; Wu, Yu-Lung
fYear
2012
fDate
26-28 Sept. 2012
Firstpage
24
Lastpage
28
Abstract
In this paper, we consider the scheduling problems with redundant-molds issue. We will heuristically solve the scheduling problem with tasks needing an arbitrary mold in its specified set of mold types to be performed while the number of each mold type is arbitrary as well and the mold set is independent of the machines. A bio-inspired approach with some greedy mold-selection skills is designed to solve the above problem.
Keywords
genetic algorithms; scheduling; GA based approach; bio-inspired algorithm; greedy mold-selection skills; identical parallel machine scheduling problem; mold types; redundant-molds issue; Biological cells; Genetic algorithms; Heuristic algorithms; Job shop scheduling; Parallel machines; Processor scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Innovations in Bio-Inspired Computing and Applications (IBICA), 2012 Third International Conference on
Conference_Location
Kaohsiung
Print_ISBN
978-1-4673-2838-8
Type
conf
DOI
10.1109/IBICA.2012.51
Filename
6337706
Link To Document