Model Penjadwalan Pekerjaan pada Flowshop dengan Kriteria Minimasi Total Waktu Tinggal Aktual

Yuniaristanto -


This paper proposes a scheduling model to determine a sequence of the jobs processed in flowshop. The objective for the model is to minimize total actual flow time accomodating the condition that jobs to be processed arrive at the shop at any times when needed and the conditon 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.


scheduling; heuristic; actual flowtime.

Full Text:



  • There are currently no refbacks.