Abstract
In recent years, the distributed permutation flowshop group scheduling problem (DPFGSP) has become an increasingly active research field. This paper deals with the distributed permutation flowshop group scheduling problem (DPFGSP) to minimize the total tardiness. The problem that the paper has considered is an extension of the traditional flowshop scheduling problem (FSP), in which all jobs are grouped into groups by nature and the decision is included for every group to select the best factory to ensure the smallest total tardiness. For the specific problem, we propose an iterated greedy (IG) algorithm to solve our problem. We carry out a lot of computational evaluations for the algorithm the paper proposing based on the 405 instances. Lastly, the effectiveness of the proposed algorithm for solve the DPFGSP with total tardiness criterion is finally proved.
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.
