Abstract
In this paper, the scheduling of the flexible flow shop scheduling problem without unemployment is considered by considering the sequence-dependent preparation times with parallel and identical machines in each workstation in order to minimize the maximum completion time that has been done so far. The assumption of the existence of sequence-dependent preparation times has not been observed in the literature on the issue of flexible workflow without unemployment. In this study, a mixed integer programming model for the problem is first developed. Since the problem under study is one of the NP-hard problems and the mathematical model solving software is not able to obtain the optimal solution of relatively large problems at a reasonable time, to provide a meta-heuristic method of genetic algorithm to obtain optimal solutions or close to optimal for the problem. The computational results show the relatively good performance of the genetic algorithm for solving problems in less time than the mathematical programming model.
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.
