JOB SCHEDULING MENGGUNAKAN METODE ALGORITMA ACTIVE, ALGORITMA NON DELAY DAN HEURISTIC SCHEDULE GENERATION (STUDI KASUS: BOROBUDUR KNITTING)
ABSTRACT: KnittingBorobuduris a
company
whichmanufacturesknitted.
The production processis oftencongestedjobateach work
station. Schedulingthe entire production processis neededateach work station, themachineisscheduled tobeexpectedbothto reduce
thedelayatwork(job).
Machineschedulingis donebyusingthe
methodof
activeschedulegenerationalgorithm,
non-delay
schedulegenerationalgorithm, andheuristicgenerationschedule. Activeschedulegenerationalgorithmisthe sortof
workwherenoprocessearly withoutinhibition(delay) otheroperating, non-delay
schedulegenerationalgorithmsisthe
sortof workwhereno machineis leftidleas
long as therearejobqueueprocesses, heuristicschedulegenerationthepriorityruleused
hereisMWKR(Most workremaining) that
isthe highestpriorityis given
tothe operationofajobthat hasthe
rest ofthe longestprocessing timetherebyaffect the orderprocessing
timejobs. Schedulingthe actual condition ofthe overallproductyieldcompletion timeof7059.12minutes.Whileschedulingusingactiveschedulegenerationalgorithmgeneratesthe
productoverallcompletion
timeof6659.77minutes.
Schedulingusingnon-delay schedulegenerationalgorithmgeneratesthe productoverallcompletion timeof6659.77minutesSchedulingusingheuristicschedulegenerationproducesthe
overallcompletion timeof7249.14minuteproduct. This
causesdifferentmakespanvaluesaresortingworkfromeachscheduling. Schedulingalgorithmselectedisactive
schedule generationandnon-delay schedulegenerationalgorithmbecause it hasthe
overallcompletion time ofthesmallestproducts.
Penulis: Suseno, Bian
Indrakusuma
Journal Code: jptmesindd140162
