Abstract
This work considered minimizing total flow time for general n-jobs and m-machines permutation flowshop scheduling problems, which are well-known to be NP-hard. The proposed approach used the combination of Decision Tree (DT) based heuristic algorithm and Scatter Search (SS) algorithm. Unlike existing heuristics available for flowshop scheduling, the DT based algorithm is used to represent the low level data into high level knowledge ie., in the form of IF-THEN else rules which are understandable by the semi-skilled worker. The SS has wide exploration of search space through diversification. The advantages of both DT and SS are utilized to form a two-phase approach. The seed solution generated from DT based approach is taken as input seed to SS algorithm to find good solution. The proposed approach is compared with most effective heuristics and recent meta-heuristics available in the literature. The proposed approach gives better solution as compared to existing composite heuristics and comparable with existing hybrid meta-heuristics.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Review of Mechanical Engineering-IREME
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
