PENJADWALAN PRODUKSI MENGGUNAKAN METODE ALGORITMA HO-CHANG DAN TABU SEARCH PADA DILLA COOKIES
Abstract
Abstract
Â
               Problems of optimization are one of the classic problems that are often found in different fields in everyday life, for example in the fields of industry, transport and trade. A good planning can generate high profits, minimize costs and are able to streamline existing resources. Scheduling is an activity of allocating limited resources to work on a number of jobs. Production scheduling problems on the home industry Dilla Cookies frequent addition of production time, or the sequence of work is not causing the production target was not met and add to makespan. Using the method of algorithm Ho-Chang and algorithms Tabu Search is helpful in minimizing the makespan value not only, but also machine idletime and perform the procedure the repetition method searches the surrounding area to find a solution the optimal. For the initial sorting where makespan workmanship based on the home industry Dilla Cookies obtained makespan for 280 seconds.
Â
Keyword:Â Production scheduling, algorithm Ho-Chang, Tabu Search Algorithm, the makespan, idle time.
References
Baker, Kenneth.1974. Introduction to Sequencing and Scheduling. Jhon Wiley and Sons,Inc.
Berlianty, I. &Arifin, M. 2010. Teknik-teknikOptimasiHeuristik. PenerbitGrahaIlmu: Yogyakarta.
Bondal, A. A. 2008. Artificial Immune Systems Applied to Job Shop Scheduling. FakultasMesindanTeknologi College Russ, UniversitasOhio:Ohio.
Conway, R. W., Maxwell, W. L., & Miller, L. W. 1967. Theory of Scheduling. Addison-Wesley, Reading, MA.
Ginting, R. 2009. PenjadwalanMesin. PenerbitGrahaIlmu:Yogyakarta.
Ginting, R. & S.,Ginting, H. 2006. Study AplikasiMetodeArtifical Immune System dalamPenjadwalan Flow Shop. Departemen Teknik Mesin Fakultas Teknik Universitas Sumatera Utara:Medan.
Glover, F. 1998. Tabu Search-Wellsprings and Challenges. European Journal of Operational Research. University of Colorado: USA.
Ho, Johnny C. Chang, Yih-Long. 1991. A New Heuristic for the n-job, M-machine Flow Shop Problem. European Journal of Operational Research. North Holland.
