z-logo
open-access-imgOpen Access
MAKESPAN MINIMIZATION IN BATIK MURNI SMEs WITH PALMER, CAMPBELL DUKDEK SMITH, AND HEURISTIC POUR ALGORITHM
Author(s) -
Wildanul Isnaini,
Emylia Arghawaty,
Zahrul Ashari
Publication year - 2020
Publication title -
spektrum industri
Language(s) - English
Resource type - Journals
eISSN - 2442-2630
pISSN - 1693-6590
DOI - 10.12928/si.v18i1.15869
Subject(s) - job shop scheduling , computer science , scheduling (production processes) , minification , mathematical optimization , schedule , mathematics , world wide web , operating system
Batik Murni is one of the Small and Medium Enterprises (SMEs) in Madiun Region that produces batik tulis and batik cap. However, the production of Batik Murni has not applied the exact method in production scheduling. This SMEs still uses intuition to make the production schedule. This condition can give disadventages for the SMEs, overstock and stockout will be happened. In this study, the researcher wants to offer a solution for the scheduling problems so Batik Murni can increase theri productivity performance. Researchers offer three production scheduling methods aimed at minimizing the makespan of Batik Tulis. The three methods used are Palmer, Champbell Dukdek Smith (CDS), and Heuristic Pour Algorithm. From this research, It can be concluded that the best production scheduling optimization at Batik Murni SMEs is obtained from the Palmer method. With makespan of 4837 minutes or 11 working days so the makespan can be minimized 54,2%.  In the order of the production process is batik sejuta bunga – batik batik turi tabur - batik seger arum - batik pecel.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom