optimizing open shop scheduling: minimizing makespan through whale optimization algorithm and transportation time consideration

This paper addresses the open shop scheduling problem, considering parallel machines within each stage and integrating job transportation times between stages, independent of job specifics. in this scheduling problem, all jobs traverse each stage, and once a job commences on a machine, it must complete without machine breakdowns. to meet this challenge, a mixed-integer linear programming (milp) model is introduced to minimize the makespan, which represents the maximum job completion time. given the np-hard nature of the open-shop scheduling problem, this study employs the whale metaheuristic algorithm to solve instances across various dimensions, spanning small, medium, and large scales. the algorithm parameters are systematically optimized using the taguchi method. results from comparing the whale algorithm with the linear model implemented in gams highlight its exceptional efficiency in handling randomly generated small and medium-sized instances. moreover, in a comparative analysis with other algorithms such as pso and de, the whale algorithm not only competes effectively but, in some instances, outperforms its counterparts. this observation underscores the algorithm’s prowess in maintaining efficiency and high performance, particularly when addressing large-scale open-shop scheduling challenges. it excels in achieving a delicate balance between exploration and exploitation, thereby avoiding local optimal solutions.