Abstract
This paper addresses parallel machine scheduling problems with fuzzy processing times. A robust genetic algorithm ( GA) approach embedded in a simulation model is proposed to minimize the maximum completion time (makespan). The results are compared with those obtained by using the “longest processing time” rule ( LPT), which is known as the most appropriate dispatching rule for such problems. This application illustrates the need for efficient and effective heuristics to solve such fuzzy parallel machine scheduling problems (FPMSPs). The proposed GA approach yields good results quickly and several times in one run. Moreover, because it is a search algorithm, it can explore alternative schedules providing the same results. Thanks to the simulation model, several robustness tests are conducted using different random number sets, and the robustness of the proposed approach is demonstrated.
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 callDisclaimer: 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.
