A GENERAL ALGORITHM FOR THEn × MFLOWSHOP SCHEDULING PROBLEM†

Publisher Website
Google Scholar
Abstract
A general algorithm, based on the concept of «Lexicographic Search” is proposed for the solution of the n job, M machine flowshop scheduling problem under the assumption that the same sequence of jobs is followed on all machines. Starting with a trial solution, the lexico graphic search, through all feasible and acceptable exchanges, leads to better solutions ultimately resulting in the optimal schedule. The search is further facilitated by the use of lower bounds which, sometimes, help in reducing the computational effort required. Computational experience indicates that the proposed algorithm is comparatively more efficient than the existing algorithms.