Batch Scheduling for Hybrid Assembly Differentiation Flow Shop to Minimize Total Actual Flow Time
Maulidya R.a, Suprayogia, Wangsaputra R.a, Halim A.H.a
a Industrial Engineering Faculty, Institut Teknologi Bandung, Bandung, 40132, Indonesia
Abstract
© Published under licence by IOP Publishing Ltd.A hybrid assembly differentiation flow shop is a three-stage flow shop consisting of Machining, Assembly and Differentiation Stages and producing different types of products. In the machining stage, parts are processed in batches on different (unrelated) machines. In the assembly stage, each part of the different parts is assembled into an assembly product. Finally, the assembled products will further be processed into different types of final products in the differentiation stage. In this paper, we develop a batch scheduling model for a hybrid assembly differentiation flow shop to minimize the total actual flow time defined as the total times part spent in the shop floor from the arrival times until its due date. We also proposed a heuristic algorithm for solving the problems. The proposed algorithm is tested using a set of hypothetic data. The solution shows that the algorithm can solve the problems effectively.
Author keywords
Algorithm for solving,Arrival time,Batch-scheduling,Due dates,Flow-shops,Flow-time,Hybrid assembly,Shop floor