In this paper, the degree of the impacts of job sequencing and job allocation on makespan and mean flowtime in a two-stage flexible flow shop scheduling is considered. This manufacturing environment fo two machine centers representing two consecutive ...
In this paper, the degree of the impacts of job sequencing and job allocation on makespan and mean flowtime in a two-stage flexible flow shop scheduling is considered. This manufacturing environment fo two machine centers representing two consecutive stages of production. Each machine center is composed of multiple identical parallel machines. Each job is to be processed serially through the two machine centers. In each machine center, a job may be processed on any of the machines. There are n independent jobs to be scheduled without preemption. Interstage buffer storage is unlimited. A sequence-first, allocate-second heuristic approach is utilized for its solution. The problem is decomposed heuristically by first determining input sequence of job order and then allocating jobs to the machines in each machine center based on the input sequence. SPT1, SPT(1+2), LPT2, and Johnson rule are employed for job sequencing purpose. RAN, CYC, and FA(First Available) rules are employed for job allocation purpose. Simulation study shows that job allocation factor has a more effect on the makespan than job sequencing factor.