Dynamic Scheduling of Large-scale Flow Shops
Based on Relative Priority Approach

Abstract

A relative priority approach is proposed to solve dynamic scheduling problem for flow shop problem in this paper. Two neighbor jobs’ relationship is represented by a relative priority, which implies permutation obstacle between them. An algorithm is developed to calculate relative priority matrix on jobs and a near-optimal result can be obtained with the calculation iteration of relative priority matrix. A printed circuit board production line, which is composed of 31 works, is used to demonstrate the efficiency of proposed approach. It shows that an excellent final sequence can be obtained while initial sequence is derived from rule-based result.