Abstract
In the literature on open shop scheduling problems, only few studies have considered the scheduling problem with sequence-dependent setup time and transportation time, and the latter can be considered as another kind of setup time. In order to be closer to real industry scenes, the open shop scheduling problem with two sequence-dependent setup times is investigated. Firstly, the mixed integer linear programming model is established. Then, an improved artificial bee colony algorithm is introduced and compared with other existing algorithms, namely genetic algorithm, particle swarm optimization, ant colony optimization, and cuckoo search algorithm. Two experiments have been conducted and the computational results show that the proposed artificial bee colony algorithm can achieve the best results in large-scale problems.
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.
