Abstract
Open shop scheduling has a special place in both production and optimization problems. This study investigates an assembly (direct flow) and disassembly (reverse flow) scheduling problem in an open shop environment where both are processed on the same machine, but only one is a no-wait operation. The objective is to minimize makespan of jobs on all machines. A mixed-integer linear program is developed. GAMS 25.1.1.2 is used to solve small size test problems. Differential Evolution (DE) Algorithm is applied to large-scale problems. A comparison of the computing results of this algorithm and the Genetic algorithm (GA), Whale Optimization Algorithm (WOA), Bat algorithm (BA), Artificial bee colony algorithm (ABC), and vibration damping optimization algorithm (VDO) is presented. Based on the results obtained, it has been found that there are no obvious differences between the performance of the algorithms, but the DE algorithm produces better solutions.
Sign-in/Register to access full text options 
Free) 
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 call
