Advanced Metaheuristics for Bicriteria No-Wait Flow Shop Scheduling Problem

摘要

No-wait flow shop scheduling problem with dual criteria of makespan and system utilization time has been addressed in this paper. The objective is to schedule the n jobs on available system of machines in such a way that the weighted sum of makespan and system utilization time is the minimum possible. System utilization time is rarely found criteria of flow shop scheduling literature. Many heuristics and metaheuristics are available in the literature for flow shop scheduling problem with the criteria of makespan, and however, no heuristic is present for criteria of system utilization time. In this paper, the dominance relation has been developed for the system of two machines. Further, since the problem taken in hand is NP-hard, therefore, advanced iterated greedy algorithm (AIGA) has been developed to solve it. Design of the experiment approach has been used to estimate the parameters of AIGA. The computational experiment is carried out on some well-known scheduling benchmarks, and the results depict the superiority of the proposed algorithm over some existing techniques in the literature.