A search algorithm for the generalized flowshop scheduling problem

Abstract This paper considers the problem of scheduling a given number of jobs to be processed on a given number of machines in a flowshop. By a realistic analysis of the assumptions and current formulation of the problem, the generalized flowshop scheduling problem is defined and a search algorithm, based on the concepts of Lexicographic search, is proposed as a possible solution to the n -job, M -machine generalized flowshop scheduling problem when the objective is to minimize total opportunity cost. The proposed algorithm uniquely specifies a linear lexicographic order relation and systematically generates schedules until the set of all feasible schedules is implicitly examined and the optimal schedule is identified. Computational results show that the proposed algorithm is comparatively more efficient than a complete enumeration procedure.