Abstract
A practical flow-shop scheduling method based on a two-stage heuristic algorithm was examined by the application of this method to a flexible assembly line where no passing is allowed and a limited buffer size is given. The scheduling method using the following procedures gives near optimal solutions within a limited computational time. (1) Preparation of an initial schedule by an expanded Johnson rule. (2) Preparation of an improved schedule by an effective enumeration method.
