M-machine No-wait Flowshop Scheduling to Minimize Total Flow Time Using An Artificial Bee Colony Algorithm

M-machine No-wait Flowshop Scheduling to Minimize Total Flow Time Using An Artificial Bee Colony Algorithm

… Download …


Part of #M-machine No-wait Flowshop Scheduling to Minimize Total Flow Time Using An Artificial Bee Colony Algorithm# :

Publishing year : 2015

Conference : International Conference on New Research Findings in Industrial Engineering and Mechanical Engineering

Number of pages : 6

Abstract: No-wait flowhop scheduling problems deal with the scheduling of a set of jobs, where each job is continuously processed through machines in the same order as the technological requirements of the process, that is, once the job is started on the first Machine, it has to be continuously processed through machines without interruption. The no-wait flowhop situation arises in many realistic production environments such as hot metal rolling, plastic molding, chemical and pharmaceutical, food processing and other industrial environments due to the processing characteristics of a product where each process follows immediately the previous one. This Paper studies m-machine no-wait traffic flow scheduling problem with the goal of minimizing total flow time. Since the problem is known as NP-hard, an Artificial Bee Colony algorithm is presented to solve large-sized problems in a reasonable computational time. We do experiments to test the effectiveness of the proposed algorithm and compare it with existing heuristics. Computational results indicate that the proposed method significantly outperforms the best-known heuristics and confirms the improvement in solution quality.