Abstract
This paper presents the scheduling model for a Multi-Stage Process which consists of the pre-process and the post-process. The pre-process is the multi-production plants, and the post-process is the buffers for combined use, This model is reduced to a One-Machine problem under the constraints of the processing time and capacity at the succeeding stations, and is formulated into an Integer-Programming problem by using the 0-1 variables which mean job sequence. In this scheduling model, the Multi-Stage Process problem is eventually formulated into the One-Machine problem to minimize the total flow time under the different due times, job sequence dependent setup times, the earliest and latest end time and restricted working times.
