Penjadwalan Pekerjaan pada No-Wait Flowshop dengan Pembatasan Common Due-Date
Main Author: | Yuniaristanto, |
---|---|
Format: | Article PeerReviewed application/pdf |
Terbitan: |
, 2003
|
Subjects: | |
Online Access: |
http://eprints.uns.ac.id/1254/1/_01_Yuniaristanto.pdf http://eprints.uns.ac.id/1254/ |
Daftar Isi:
- This paper addresses job-scheduling in no-wait flowshop.No-wait floshop ives condition that each job processed without any interuptions on machine or between two machines. Criteria of this problems is to minimize total actual flowtime that accomodate condition that jobs arrive in the shop whenthey needed and deliver them to due-date. Heuristic algorithm is developed to find feasible solutions. An numerical example is also provided to show how the proposed method work. Example results show total actual flowtime in no-wait flowshop higher than total actual flowtime in general floshop.. Keywords : scheduling, no-wait flowshop, total actual flowime.