Reentrant Flow Shop Scheduling considering Multiresource Qualification Matching

Abstract

With the development of technology and industry, new research issues keep emerging in the field of shop scheduling. Most of the existing research assumes that one job visits each machine only once or ignores the multiple resources in production activities, especially the operators with skill qualifications. In this paper, we consider a reentrant flow shop scheduling problem with multiresource considering qualification matching. The objective of the problem is to minimize the total number of tardy jobs. A mixed integer programming (MIP) model is formulated. Two heuristics, namely, the hill climbing algorithm and the adapted genetic algorithm (GA), are then developed to efficiently solve the problem. Numerical experiments on 30 randomly generated instances are conducted to evaluate the performance of proposed MIP formulation and heuristics