DocumentCode
3067615
Title
Application of an inherently parallel heuristic methodology to flow-shop scheduling
Author
Paramanick, I.
Author_Institution
Dept. of Electr. & Comput. Eng., Alabama Univ., Huntsville, AL
fYear
1992
fDate
12-15 Apr 1992
Firstpage
155
Abstract
Presents an inherently parallel heuristic solution methodology called parallel dynamic interaction (PDI) and report its application to the flow-shop scheduling problem. Results indicate that, across the 40 examples studied, PDI solutions were on an average of within 2.5% of optimal. Additionally, the time taken for PDI to arrive at such high-quality solutions was negligible compared to that taken by conventional search techniques
Keywords
computational complexity; optimisation; scheduling; PDI solutions; flow-shop scheduling; high-quality solutions; inherently parallel heuristic methodology; parallel dynamic interaction; Application software; Cities and towns; Concurrent computing; Job shop scheduling; NP-hard problem; Parallel processing; Processor scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Southeastcon '92, Proceedings., IEEE
Conference_Location
Birmingham, AL
Print_ISBN
0-7803-0494-2
Type
conf
DOI
10.1109/SECON.1992.202326
Filename
202326
Link To Document