Algoritma Penentuan Ukuran Batch Integer pada Penjadwalan Flowshop Satu Mesin

  Author(s)
Hadigufri Triha    (Jurusan Teknik Industri, Fakultas Teknik, Universitas Andalas, Padang - Indonesia)
Ahmad Syafruddin Indrapriyatna (Jurusan Teknik Industri, Fakultas Teknik, Universitas Andalas, Padang - Indonesia)
Jonrinaldi Jonrinaldi (Jurusan Teknik Industri, Fakultas Teknik, Universitas Andalas, Padang - Indonesia)
Berry Yuliandra (Jurusan Teknik Mesin, Fakultas Teknik, Universitas Andalas, Padang - Indonesia)

 ) Corresponding Author
Copyright (c) 2016 Hadigufri Triha, Ahmad Syafruddin Indrapriyatna, Jonrinaldi Jonrinaldi, Berry Yuliandra
  Abstract

Scheduling is an important area of production planning and control. Scheduling is required to produce an existing job by allocating existing resources in the proper execution order. Production schedules arranged effectively and efficiently to maximize resources utility, minimize waiting and idle time and increase productivity. The flowshop batch scheduling model for one machine that takes inventory and quality cost into account has been developed by Indrapriyatna et al (2007a). However, the model yet effective in converting the results of batch size into integers. This study tried to resolve this problem by using a modification of Branch and Bound Algorithm approach.

 

  Keywords
Penjadwalan; batch; flowshop; Algoritma Branch and Bound
  Click to Read the Full Text
PDF
  References

[1] D. D. Bedworth dan J. E. Bailey. (1987). Integrated Production Control Systems: Management, analysis, design Second edition. Singapore: John Wiley & Sons Inc.

[2] J. E. Biegel. (1971). Production Control: A quantitative approach, New Jersey, USA: Prentice-Hall, Inc.

[3] A. H. Halim dan H. Ohta. (1993). “Batch Sheduling Problem Through the Flow Shop with Both Receiving and Delivery Just In Time”, International Journal of Production Research, Vol. 31, pp. 1943-1955.

[4] A. H. Halim dan H. Ohta. (1994). “Batch Scheduling Problem to Minimize Inventory Cost in the Shop with Both Receiving and Delivery Just In Time, International Journal of Production Eco, Vol. 33, pp. 185-195.

[5] A. H. Halim, J. Silalahi dan H. Ohta. (2001). “A Batch Scheduling Model Considering Quality Costs for the Shop with Receiving and Delivery Just In Time”, Proceeding of the 2001 International Conference on Production Research, Prague, Czech Republic. 29 July – 3 August.

[6] A. S. Indrapriyatna, Suprayogi, B. P. Iskandar dan A. H. Halim. (2007). “A Batch Scheduling Model for A Single Machine Processing Discrete Parts to Minimize Total Inventory and Quality Cost”, Proceeding of the 1st Asia Pacific Conference on Manufacturing Systems, Bali, Indonesia, 5 – 6 Septermber.

[7] A. S Indrapriyatna Suprayogi, B. P. Iskandar dan A. H. Halim. (2007). “Model Penjadwalan Batch pada Flowshop untuk Minimasi Biaya Simpan dan Kualitas’, Jurnal Teknik dan Manajemen Industri ITB, Vol. 27, pp. 142-163.

[8] K. R. Baker. (1974). Introduction to Sequencing and Scheduling, New York, USA: John Wiley & Sons Inc.

[9] T’kindt, Vincent dan Jean-Charles Billaut. (2006). Multicriteria Scheduling, Theory, Models, and Algorithms, Second Edition. France: Springer.

[10] E. Herjanto. (2008). Manajemen Operasi Edisi Ketiga, Jakarta, Indonesia: Grasindo.

[11] H. Prasetya dan F. Lukiastuti. (2009). Manajemen Operasi, Yogyakarta, Indonesia: Media Pressindo.

[12] M. S. Bazaraa, H. D. Sherali, dan C. M. Shetty. (2007). Nonlinear Programming, 2nd ed. Canada: John Wiley & Sons Inc.

[13] A. H. Land, dan A. G. Doig. (1960). An Automatic Method of Solving Discrete Programming Problems. Econometrica 28 (3). pp. 497–520.

[14] M. J. Brusco dan S. Stahl. (2005). Statistics and Computing: Branch and Bound Applications In Combinatorial Data Analysis, New York, USA: Springer Science + Business Media, Inc.

[15] T. T. Dimyati dan A. Dimyati. (2006). Operations Research: Model-Model Pengambilan Keputusan, Bandung, Indonesia: Sinar Baru Algensindo.

StatisticsArticle Metrics

This article has been read : 445 times
PDF file viewed/downloaded : 172 times

This article can be traced from





Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.