Model Penjadwalan Pekerjaan pada Zero-buffer Flowshop Tipe (1) dengan Kriteria Minimasi Total Waktu Tinggal Aktual

Abstract

This paper proposes a scheduling model to determine a sequence of the jobs processed in zero-buffer flowshop with separated setup times. In this case, the setup for the next job on current machine can start as soon as this machine completes its processing of the current job. The objective for the model is to minimize total actual flow time accommodating the condition that jobs to be processed arrive at the shop at any times when needed and the condition that the completed jobs be delivered at a common due-date. A heuristic algorithm searching the best solution from the resulting feasible solution has been developed. The numerical experience showing the characteristic of the problem is also presented.