Advertisement
Published in:
2015 | OriginalPaper | Chapter
Minimizing Makespan Using Node Based Coincidence Algorithm in the Permutation Flowshop Scheduling Problem
Authors : Ornrumpha Srimongkolkul, Prabhas Chongstitvatana
Published in: Industrial Engineering, Management Science and Applications 2015
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
This paper proposes a Node-Based Coincidence Algorithm (NB-COIN) for the permutation flowshop scheduling problems (PFSP) aimed at Makespan minimization. For almost half a century, a variety of complex algorithms have been introduced to solve the problems. Nevertheless, these algorithms will be useless if they fail to implement in practice where computational time and complexity of algorithm become an important issue of concern. NB-COIN is proved to be an effective algorithm and it is extremely fast. Based on the bench-mark data sets of Taillard, the presented algorithm provides acceptable solutions within a very short period of time. More importantly, the results generated by NB-COIN are also better than other well-known algorithms in consideration.