Usulan Algoritma Branch And Bound Untuk Penjadwalan Job Shop Di CV Citra Sriwijaya Advertising

., Ellis (2012) Usulan Algoritma Branch And Bound Untuk Penjadwalan Job Shop Di CV Citra Sriwijaya Advertising. Other thesis, Sekolah Tinggi Teknik Musi.

	Text TI-2012-208011-cover.pdf Download (37kB)
	Text TI-2012-208011-abstract.pdf Download (3kB)
	Text TI-2012-208011-tableofcontent.pdf Download (13kB)
	Text TI-2012-208011-chapter1.pdf Download (13kB)
	Text TI-2012-208011-chapter2.pdf Restricted to Repository staff only Download (430kB)
	Text TI-2012-208011-chapter3.pdf Restricted to Repository staff only Download (36kB)
	Text TI-2012-208011-chapter4.pdf Restricted to Repository staff only Download (293kB)
	Text TI-2012-208011-chapter5.pdf Restricted to Repository staff only Download (23kB)
	Text TI-2012-208011-conclusion.pdf Download (3kB)
	Text TI-2012-208011-reference.pdf Download (4kB)
	Text TI-2012-208011-attachment.pdf Restricted to Repository staff only Download (846kB)
	Text TI-2012-208011-complete.pdf Restricted to Repository staff only Download (1MB)

Abstract

CV Citra Sriwijaya Advertising is a company that produces promotional tools that are job shop. Methods of production scheduling applied is the First Come First Serve (FCFS). FCFS method is a scheduling method that prioritizing the order that arrived first. This cause the time of completion all process to be long or the makespan value is high. Therefore, in this study are given scheduling solution using Branch and Bound algorithm. Branch and Bound algorithm is a scheduling method that aims to minimize makespan. Branching in this study produces a sequence of scheduling 1-21-15-34-2-22-16-35-17-18-19-36-37-38-23-24-25-3-4-5-27-6-28-7-29-8-30-9-10-11-12-31-26-20-32-33-13-39-14. Based on these results, Branch and Bound algorithm successfully minimizes the makespan value by 18874.30 seconds or 11,67% of FCFS method.

Actions (login required)

View Item