Preferences help
enabled [disable] Abstract
Number of results
2019 | 127 | 3 | 212-224
Article title

Scheduling of Flowshop Type Production with Dannenbring Method to Obtain Optimal Results with Observing Waiting Time and Weight of Jobs

Title variants
Languages of publication
Linear programming is a step or process to get maximum results with existing resources or it can be said the process of looking for optimal value. One part of scheduling is production scheduling. production scheduling is the use of resources that are few but make the most profit. This paper discusses production scheduling using flowshop type production scheduling by taking into account transportation times and work weights. This paper uses the Dannenbring method with the aim of finding the optimal sequence of problems by considering the total production time (makespan) and the average Weigted Mean Flow Time (WMFT). Based on the results of the Dannenbring method, the results of flowshop scheduling are obtained with a total makespan of 75 hours and the WMFT value is 28, 87 hours.
Physical description
  • Faculty Mathematics and Natural Science, Universitas Padjadjaran, Indonesia
  • Department of Mathematics, Faculty Science and Technology, Universitas Islam Negeri Sunan Gunung Djati Bandung, Indonesia
  • Department of Mathematics, Faculty Science and Technology, Universitas Islam Negeri Sunan Gunung Djati Bandung, Indonesia
  • Department of Mathematics, Faculty of Mathematics and Natural Science, Universitas Padjadjaran, Indonesia
  • Department of Marine Science, Faculty of Fishery and Marine Science, Universitas Padjadjaran, Indonesia
  • [1] A. Chaudhry, S. Mahmood, No-wait Flowshop Scheduling Using Genetic Algorithm, Proceedings of the World Congress on Engineering Vol. 3, (2012).
  • [2] Abdeljaouad, M.A., Bahroun, A. Omrane, A. Fondrevelle. 2015. Job-shop Production Scheduling with Reserve Flows. European Journal of Operational Research Vol. 244 pages 117-128
  • [3] Ahmad, Q. S. Khan, M. (2015). Constrained Flow-Shop Scheduling Problem with m Machines. Journal of Multidisciplinary Engineering Science and Technology Vol. 2 Issue 2, 169-172.
  • [4] Ahonen, H. & de Alvarenga, A. G. (2016). Scheduling flexible flow shop with recirculation and machine sequence dependent processing times: formulation ans solution procedures. International Journal of Advance Manufacturing Technology, 89(1-4), 765-777. doi:10.1007/s00170-016-9093-3
  • [5] Allahverdi, A. (2015). The Third Comprehensive Survey on Scheduling Problems with Setup Times/costs. European Journal of Operational Reseach 246(2), 345-378
  • [6] Aydilek, A., Aydilek, H., & Allahverdi, A. (2015). Production in a two-machine flowshop scheduling environment with uncertain processing and setup times to minimize makespan. International Journal of Production Research, 53(9), 2803-2819.
  • [7] Chen, W., Li, J., & Ma, W. (2016). Hybrid flow shop rescheduling algorithm for perishable products subject to a due date with random invalidity to the operational unit. International Journal of Advanced Manufacturing Technology, 93(1-4), 225-239. doi:10.1007/s00170-016-8859-y
  • [8] Cui, Z., & Gu, X. (2015). An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop problems. Neurocomputing, 148, 248-259. doi:10.1016/j.neucom.2013.07.056
  • [9] Conway, R. W., Maxwell, W. L. and Miller, L. W. 1967 Theory Of Scheduling Dover Publications INC.
  • [10] Dang, F., Li, W., & Ye, H. (2018) An Efficient Constructive Heuristic to Balance Trade-offs Between Makespan and Flowtime in Permutation Flow Shop Scheduling. 46th SME North American Manufacturing Research Conference, NAMRC 46, Texas, USA 10.1016/j.promfg.2018.07.005
  • [11] D.G. Dannenbring, An evaluation of flow shop sequencing heuristics, Management Sci. 23, 1273-1283, (1977).
  • [12] X. Dong, H. Huang, P. ChenAn improved NEH-based heuristic for the permutation flowshop problem Comput. Oper. Res. 35 (2008), pp. 3962-3968
  • [13] Ebrahimi, M., Fatemi Ghomi, S. M. T., & Karimi, B. (2014). Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates. Applied Mathematical Modelling, 38(9-10), 2490-2504. doi:10.1016/j.apm.2013.10.061
  • [14] Fahmy S.A, Balakhrihman S, EIMekkawy TY (2008) A Generic deadlock-free Reactive Scheduling Approach. Int J Proud Res 46(1): 1-20
  • [15] Fuchigami, H.Y et al. (2017). A Survey of Case Studies in Production Scheduling: Analysis and Perspectives. Journal of Computational Science
  • [16] Garey, M.R., D.S., Johnson, and R. Sethi. 1976. The complexity of flowshop and job shop scheduling. Mathematics of Operations Research, 1 (2), 117-121
  • [17] Ginting, Rosnani. (2009). Penjadwalan Mesin. Yogyakarta: Graha Ilmu
  • [18] Gonzalez-Neira, E.M. et al. (2017). Flow-Shop Sceduling under Uncertainties: Riview and Trends. International Journal of Industrial Engineering Computation 8 (2017) 399–426 doi: 10.5267/j.ijiec.2017.2.001
  • [19] Grabowski J, Wodecki M (2004). A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Computers & OR, 31: 1891-1909
  • [20] Gupta, D,. Singla,. P and Bala. Constrained n-job, 3-machine flow shop scheduling problem with transportation time. IJRAES, Vol. 2, Issue 2, Feb (2012), pp. 782-785.
  • [21] Hossain, M., Asadujjaman, M., Nayon, M. A. Bhattacharya, P. (2014). Minimization of Makespan in Flow Shop Scheduling Using Heuristics. International Conference on Mechanical, Industrial and Energy Engineering 2014 ICMIEE-PI-140163-2.
  • [22] Javad,. S (2018) "The Integration of Maintenance Decisions and Flow Shop Scheduling. " PhD diss., University of Tennessee, 2018.
  • [23] Lee, T., et all (2019). A Riview of Scheduling Problem and Resolution Methods in Flexible Flow Shop. International Journal of Industrial Engineering Computation, 10(1), 67-88.
  • [24] Li, Dai & Zhang (2015). Relationship between Maximum Completion Time and Total Completion Time. Procedia Manufacturing, Vol. 1, 2015, Pages 146-156
  • [25] Lin, S. Huang, C. Lu, C. & Ying, K (2012). Minimizing Total Flow Time in Permutation Flowshop Environment. ICIC International, Vol 8, Number 10(A)
  • [26] Lin, Y. K., & Hsieh, F. Y. (2014). Unrelated Parallel Machine Scheduling with SetupTimes and Ready Times. International Journal of Production Research, 52(4), 1200-1214
  • [27] Maflahah, I., Mahcfud, Udin, F., Model Penunjang Keputusan Jadwal Produksi Jus Buah Segar. Jurnal Teknik Industri, Februari 2012; hal. 51-59.
  • [28] Nasr A-H, EIMekkawy TY (2011) Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm. Int J Prod Econ 132(2): 279–291
  • [29] Pandian, P. Rajendran, P. (2010). Solving Constrained Flow-Shop Scheduling Problems with Three Machines. Int. J. Contemp. Math. Sciences, Vol. 5, 2010, Pages. 19, 921-929
  • [30] Panneerselvam, R. (1999). Heuristic for Moderated Job Shop Scheduling Problem to Minimize Makespan. Industrial Engineering Journal, 28, 26-29.Note that the journal title, volume number and issue number are set in italics.
  • [31] Pinedo, M.L. (2012). Scheduling Theory, Algorithms, and Systems. Springer, New York, USA
  • [32] Pugazhenthi., R & Xavior, A. M (2014). A Genetic Algorithm Applied Heuristic to Minimize the Makespan in a Flow Shop. Procedia Engineering 97 (2014) 1735 – 1744 doi:10.1016/j.proeng.2014.12.325
  • [33] Rahmani, D., & Heydari, M. (2014). Robust and stable flow shop scheduling with unexpected arrivals of new jobs and uncertain processing times. Journal of Manufacturing Systems, 33(1), 84-92.
  • [34] Ribas, I., & Companys, R. (2015). Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization. Computers & Industrial Engineering, 87, 30-39. doi:10.1016/j.cie.2015.04.013
  • [35] Rossit, D. A., Tohmé, F., & Frutos, M. (2018). The non-permutation flow-shop scheduling problem: a literature review. Omega, 77, 143-153.
  • [36] Sadjadi, S., Aryanezhad, M. Ziaee, M. (2008). The General Flowshop Scheduling Problem: Mathematical Models. Journal of Applied Science 8(17), 3032-3037
  • [37] Semančo, P. Modrák, V. (2012). A Comparison of Constructive Heuristics with the Objective of Minimizing Makespan in the Flow-Shop Scheduling Problem. Acta Polytechnica Hungarica Vol. 9, No. 5, 177-190
  • [38] Subramaniam V, Raheja AS, Reddy KRB (2005). Reactive Repair Tool for Job Shop Schedule. Int J Prod Res 43: 1-23
  • [39] T. C. Edwin Cheng, Jatinder N. D. Gupta, Guoqing Wang. A review of flowshop scheduling research with setup times. Production and operation management, Volume 9, Issue 3, September 2000 , Pages 262-282
  • [40] Wang, F., Rao, Y., Desaign and Application of a New Hybrid Heuristic Algorithm for Flowshop Scheduling. International Journal Computer Network and Information Security, March 2011; hal. 41-49.
  • [41] Wan, L. Ma, Ran. & Yuan, J., 2013 Primary–secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines. Theorical Computer Science, Vol 518 pages 117-123
  • [42] Yenisey, M., & Yagmahan, B. (2014). Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends. Omega, 45, 119-135
  • [43] Y. Liu, H. Dong, N. Lohse, S. Petrovic, N. Gindy, An investigation into minimizing total energy consumption and total weighted tardiness in job shops. J. Clean. Prod. 65 (2014) 87-96
Document Type
Publication order reference
YADDA identifier
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.