Model Integrasi Penjadwalan Batch dan Penjadwalan Preventive Maintenance dengan Kriteria Minimisasi Biaya Simpan, Biaya Setup, Biaya Pm, serta Biaya Rework pada Mesin Stabil


  • Zahedi Zahedi Bina Nusantara University



flow time, production run, stable machine


This study developed a model of batch scheduling involving the unavailability machine to minimize setup costs, cost of preventive maintenance and the cost of rework in a stable machine. This model is considered necessary in order to understand the effect of the unavailability machine for production runs and to understand the effect on the batch production schedule. The results of this study indicate that the first and last run will not give single batch. Given a hypothetical example of how the model and algorithm developed solve the problem instance. 


Plum Analytics


Barlow, R. E., Proschan, F., (1965). Mathematical theory of reliability. New York: John Willey & Sons, Inc.

Buckchin, J., Tzur, M., Jaffe, M., (2002). Lot Splitting to Minimize Average Flow-Time in a Two-Machines Flow Shop. IEE Transactions, 34, 953-970.

Dobson, G., Karmarkar, U.S., Rummel, J.L., (1987). Batching to Minimize Flow Times on One Machine. Management Science, 33, 784-799.

Dobson, G., Karmarkar, U.S., Rummel, J.L., (1989). Batching to Minimize Flow Times on Heterogeneous Machines. Management Science, 35, 607-613.

Duarte, J. C., Soares, C. G., (2007). Optimisation of preventive maintenance plan of a series components system with Weibull hazard function. RTA4, Special Issue, 33-39,.

Duarte, J.C., Craveiro, J.T., Trigo, T. (2006). Optimization of the preventive maintenance plan of a series components system. International Journal of Pressure Vessels and Piping, 83, 244-

Ebeling, C.E., (1997). Reliability and Maintainability Engineering. Singapore: Mc-Graw Hill Inc.

Fleischer, J., Waweria, M., Niggeschmidt, S. (2008). Machine Life Cycle Cost Estimation via Monte-

Carlo Simulation. Proceeding of 4th CIR Conference on Life Cycle Engineering, 449-453.

Halim, A. H. (1993). Batch Scheduling for Production Systems under Just in Time Environment. Disertasi Doktor, University Osaka Perfecture, Japan.

Halim, A. H., Ohta, H. (1993). Batch-scheduling problems through flow shop with both receiving and delivery just in time. Int. J. Prod. Res, 31, 1943-1955.

Halim, A. H., dan Ohta, H., (1994). Batch Scheduling Problems to Minimize Inventory Cost in the Shop with both Receiving and Delivery Just in Times. International Journal of Production Economics, 33, 185-195.

Halim, A. H., Miyazaki, S. Ohta, H., (1994). Batch-scheduling problems to minimize actual flow times of parts through the shop under JIT environment. European Journal of Operational Research, 72, 529-544.

Halim, A. H., Ohta, H., (1996). A Dynamic Batch Scheduling Model for a Flow Shop with Just in Time Environment. Proceedings of The 1996 Pacific Conference on Manufacturing, Korea, 398-403.

Halim, A. H., Silalahi, J., Ohta, H., (2001): A Batch Scheduling Model Considering Quality Costs for the Shop with Receiving and Delivery Just in Time. Proceedings of The 2001 International Conference on Production Research.

Indrapriyatna, A.S., (2008). Batch Scheduling Model on Single Machine Deteriorated to Minimize Total Inventory and Quality Cost. Journal of Industrial Engineering, 10(1), 26-37.

Meng, G., Heragu, S. (2004). Batch Size Modelling in a Multi-Items Discrete Manufacturing System via an Open Queuing Network. IEE Transactions, 36, 743-753.

Olafson, S. dan Shi, L. (2000). A Method for Scheduling in Parallel Manufacturing Systems with Flexible Resources. IEE Transactions, 32, 135-146.

Rigdon, S.E., Basu, A.P., (2000). Statistical Methods for Reliability of Repairable Systems. Canada: John Willey & Sons Inc.

Sherwin, D.J., Bossche, A. (1993). The Reliability, Availability and Productiveness of Systems.

Hongkong: Chapman & Hall.

Tansel, B. C., Kara, B.Y., Sabuncouglu, I., (2001). An Efficient Algorithm for the Single Machine Total Tardiness Problem. IEE Transactions, 33, 661-676.

Xiao, W., Li, C., (2002). Approximation Algorithms for Common Due Date Assignment and Job Scheduling on Parallel Machines. IEE Transactions, 34, 467-477.






Abstract 281  .
PDF downloaded 218  .