Dynamic Programming to Solve Picking Schedule at the Tea Plantation

Budijati, Siti Mahsanah and Iskandar, Bermawi Priyatna (2018) Dynamic Programming to Solve Picking Schedule at the Tea Plantation. [Artikel Dosen]

Text C.1.2. Dynamic Programming to solve-IJET Vol 7 No 4.30 2018.pdf Download (308kB)

Abstract

The tea picking schedule at PT Perkebunan Ciater isset to be the same for all plantation blocks. Infact, the altitude from sea level and the pruning age of each plantation block is different, this results in thedifference of buds’growth. The implementation of the same pick-ing schedule causesthe quality and quantity of tea buds often couldnot be fulfilled. This research is to determine the precise picking schedule by considering the buds’growth of each plantation block. Two steps are implemented to solve the problem. The first step is to look for picking period and the pattern of buds’quality for each plantation block, which corresponds to the altitude of the location and the pruning age. The regression method is applied in this first step. The buds’quality pattern is then used to determine the cost of de-creasing buds’quality and the costs of the budsthat left in the plantation. The second step is to develop the picking schedule using dy-namic programming, which minimizesthe total cost of picking. In addition to this, we also develop a rolling schedule, which schedule time interval is three days. The modelresults show that the proposed schedule givesa better total cost than the current schedule and the buds’ quality target is easier to achieve.
Keywords:Dynamic Programming; Minimizes Cost; Picking Schedule

Item Type:	Artikel Dosen
Subjects:	T Technology > T Technology (General)
Divisi / Prodi:	Faculty of Industrial Technology (Fakultas Teknologi Industri) > S1-Industrial Engineering (S1-Teknik Industri)
Depositing User:	Siti Mahsanah Budijati
Date Deposited:	27 Dec 2019 06:44
Last Modified:	27 Dec 2019 06:44
URI:	http://eprints.uad.ac.id/id/eprint/15930

Actions (login required)

View Item