Skip to main content
SpringerLink
Log in

Determination of number of kanban in a cellular manufacturing system with considering rework process

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

The main element of just-in-time production system is kanban and the number of kanban influences the product inventory level. This research studies the cellular manufacturing system controlled by kanban mechanism which defective items are produced in any production run of each product and rework is carried out to transform them into serviceable items. In each cycle after the normal production of each product, the machine is setup for the rework process. In this paper, a mixed-integer nonlinear programming (MINLP) model in order to minimize total cost was developed to determine number of kanban, batch size, and number of batches. To avoid the large computational time in optimal solution, a particle swarm optimization (PSO) and simulated annealing (SA) algorithms as metaheuristic methods are used for solving a large MINLP. Some problems are solved by PSO and SA and performance of the PSO and the SA is evaluated by comparing their results with the optimal solution. It is shown that both PSO and SA result in a near-optimal solution but the PSO algorithm gives a better performance than the SA method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Liu N, Kim Y, Hwang H (2009) An optimal operating policy for the production system with rework. Comput Ind Eng 56(3):874–887

    Article  Google Scholar 

  2. Chiu YS, Chen KK, Ting CK (2012) Replenishment run time problem with machine breakdown and failure in rework. Expert Syst Appl. doi:10.1016/j.eswa.2011.08.005

  3. Sarker BR, Jamal AMM, Mondal S (2008) Optimal batch sizing in a multi-stage production system with rework consideration. Eur J Oper Res 184(3):915–929

    Article  MathSciNet  MATH  Google Scholar 

  4. Chiu SW, Chiu YSP (2006) Mathematical modeling for production system with backlogging and failure in repair. J Sci Ind Res 65(6):499–506

    Google Scholar 

  5. Jamal AMM, Sarker BR, Mondal S (2004) Optimal manufacturing batch size with rework process at a single-stage production system. Comput Ind Eng 47(1):77–89

    Article  Google Scholar 

  6. Chiu YSP, Liu SC, Chiu CL, Chang HH (2011) Mathematical modeling for determining the replenishment policy for EMQ model with rework and multiple shipments. Math Comput Model 54(9–10):2165–2174

    Article  MathSciNet  MATH  Google Scholar 

  7. Chiu SW, Ting CK, Chiu YSP (2007) Optimal production lot sizing with rework, scrap rate, and service level constraint. Math Comput Model 46(3–4):535–549

    Article  Google Scholar 

  8. Lin HD, Chiu YSP, Ting CK (2008) A note on optimal replenishment policy for imperfect quality EMQ model with rework and backlogging. Comput Math Appl 56(11):2819–2824

    Article  MathSciNet  MATH  Google Scholar 

  9. Liu JJ, Yang P (1996) Optimal lot-sizing in an imperfect production system with homogeneous reworkable jobs. Eur J Oper Res 91(3):517–527

    Article  MATH  Google Scholar 

  10. Sridhar J, Rajendran C (1996) Scheduling in flow shop and cellular manufacturing systems with multiple objectives—a genetic algorithmic approach. Product Plan Control 7(4):374–382

    Article  Google Scholar 

  11. Hutchins D (1993) Just in time. Productivity Press (India) (P) Ltd, Madras

    Google Scholar 

  12. Shahabudeen P, Gopinath R, Krishnaiah K (2002) Design of bi-criteria kanban system using simulated annealing technique. Comput Ind Eng 41(4):355–370

    Article  Google Scholar 

  13. Fukukawa T, Hong SC (1993) The determination of the optimal number of kanbans in a JIT production system. Comput Ind Eng 24(4):551–559

    Article  Google Scholar 

  14. Monden Y (1983) The Toyota production system. Industrial Engineering and Management Press, Norcross (GA)

    Google Scholar 

  15. Kimura O, Terada H (1981) Design and analysis of pull system, a method of multi stage production control. Int J Product Res 19(3):241–253

    Article  Google Scholar 

  16. Bitran GR, Chang L (1987) A mathematical programming approach to a deterministic kanban system. Manag Sci 33(4):427–441

    Article  MATH  Google Scholar 

  17. Bard JF, Golany B (1991) Determining the number of kanban in a multiproduct multistage production system. Int J Product Res 29(5):881–895

    Article  Google Scholar 

  18. Mitwasi MG, Askin RG (1994) Production planning for a multi-item, multi-stage kanban system. Int J Product Res 32(5):1173–1195

    Article  MATH  Google Scholar 

  19. Gupta SM, Al-Turki YAY (1998) Adapting JIT manufacturing systems to preventive maintenance interrupts. Product Plan Control 9(4):349–359

    Article  Google Scholar 

  20. Sarker BR, Balan CV (1996) Operations planning for kanbans between two adjacent workstations. Comput Ind Eng 31(1–2):221–224

    Article  Google Scholar 

  21. Sarker BR, Balan CV (1998) Operations planning for a single-stage kanban system operating under linear demand. Int J Product Res 36(2):357–375

    Article  MATH  Google Scholar 

  22. Sarker BR, Balan CV (1999) Operations planning for a multi-stage kanban system. Eur J Oper Res 112(2):284–303

    Article  MATH  Google Scholar 

  23. Wang S, Sarker BR (2006) Optimal model for a multi-stage supply chain system controlled by kanban under JIT philosophy. Eur J Oper Res 172(1):179–200

    Article  MATH  Google Scholar 

  24. Kojima M, Nakashima K, Ohno K (2008) Performance evaluation of SCM in JIT environment. Int J Product Econ 115(2):439–443

    Article  Google Scholar 

  25. Rabbani M, Layegh J, Mohammad Ebrahim R (2009) Determination of number of kanbans in a supply chain system via Memetic algorithm. Adv Eng Softw 40(6):431–437

    Article  MATH  Google Scholar 

  26. Widyadana GA, Wee HM, Chang JY (2010) Determining the optimal number of kanban in multi-products supply chain system. Int J Syst Sci 41(2):189–201

    Article  MathSciNet  Google Scholar 

  27. Chaharsooghi SK, Sajedinejad A (2010) Determination of the number of kanbans and batch sizes in a JIT supply chain system. Sci Iran 17(2E):143–149

    Google Scholar 

  28. Lannone R, Miranda S, Riemma S (2009) The search for the optimal number of kanbans in unstable assembly-tree layout systems under intensive loading conditions. Int J Comput Integr Manuf 22(4):315–324

    Article  Google Scholar 

  29. Azadeh A, Ebrahimipour V, Bavar P (2010) A hybrid GA-simulation approach to improve JIT systems. Int J Product Res 48(8):2323–2344

    Article  MATH  Google Scholar 

  30. Parveen M, Rao TVVLN (2010) Optimal batch size in a single-stage and optimal number of kanbans in a multi-stage JIT production-delivery system with rework consideration. Int J logist Syst manag 7(1):56–80

    Google Scholar 

  31. Hou TH, Hu WC (2011) An integrated MOGA approach to determine the Pareto-optimal kanban number and size for a JIT system. Expert Syst Appl 38(5):5912–5918

    Article  Google Scholar 

  32. Barzoki MR, Jahanbazi M, Bijari M (2011) Effects of imperfect products on lot sizing with work in process inventory. Appl Math Comput 217(21):8328–8336

    Article  MathSciNet  MATH  Google Scholar 

  33. Haji R, Haji A, Sajadifar M, Zolfaghari S (2008) Lot sizing with non-zero setup times for rework. J Syst Sci Syst Eng 17(2):230–240

    Article  Google Scholar 

  34. Biswas P, Sarker BR (2008) Optimal batch quantity models for a lean production system with in-cycle rework and scrap. Int J Product Res 46(23):6585–6610

    Article  Google Scholar 

  35. Chiu Y, Chang CY (2009) Optimal jit production and delivery lot size model that considers vendor reworking process and variable setup cost. J Chin Inst Ind Eng 26(2):99–108

    Article  MathSciNet  Google Scholar 

  36. Yildiz AR (2008) Hybrid Taguchi-harmony search algorithm for solving engineering optimization problems. Int J Ind Eng Theory, Appl Pract 15(3):286–293

    Google Scholar 

  37. Yildiz AR (2009) A novel particle swarm optimization approach for product design and manufacturing. Int J Adv Manuf Technol 40(5–6):617–628

    Article  Google Scholar 

  38. Yildiz AR (2009) Hybrid immune-simulated annealing algorithm for optimal design and manufacturing. Int J Mater Prod Technol 34(3):217–226

    Article  Google Scholar 

  39. Yildiz AR (2009) A new design optimization framework based on immune algorithm and Taguchi method. Comput Ind 60(8):613–620

    Article  Google Scholar 

  40. Yildiz AR (2009) A novel hybrid immune algorithm for global optimization in design and manufacturing. Robotics Comput Integr Manuf 25(2):261–270

    Article  Google Scholar 

  41. Yildiz AR (2009) An effective hybrid immune-hill climbing optimization approach for solving design and manufacturing optimization problems in industry. J Mater Process Technol 50(4):224–228

    Google Scholar 

  42. Yildiz AR, Saitou K (2011) Topology synthesis of multi-component structural assemblies in continuum domains. ASME J Mech Des 133:1

    Article  Google Scholar 

  43. Kennedy J, Eberhart RC (1995) Particle swarm optimization. proceeding of the IEEE International Conference on Neural Networks. Piscataway: IEEE Press 4:1942–1948

    Google Scholar 

  44. Salman A, Ahmad I, Madani S (2002) A particle swarm optimization for task assignment problem. Microprocess Microsyst 26(8):363–371

    Article  Google Scholar 

  45. Shigenori N, Takamu GJ, Toshiki Y, Yoshikazu F (2003) A hybrid particle swarm optimization for distribution state estimation. IEEE Trans Power Syst 18(1):60–68

    Article  Google Scholar 

  46. Shi Y, Eberhart RC (1998) A modified particle swarm optimizer, Proceedings of IEEE International Conference on Evolutionary Computation. Anchorage, Alaska. pp 69–73

  47. Kirkpatrick S, Gelatt CD, Veechi MP (1983) Optimization by simulated annealing. Sci 220(4598):671–679

    Article  MATH  Google Scholar 

  48. Arkat J, Saidi M, Abbasi B (2007) Applying simulated annealing to cellular manufacturing system design. Int J Adv Manuf Technol 32(5–6):531–536

    Article  Google Scholar 

  49. Safaei N, Saidi-Mehrabad M, Jabal-Ameli MS (2008) A hybrid simulated annealing for solving an extended model of dynamic cellular manufacturing system. Eur J Oper Res 185(2):563–592

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Faculty of Engineering, University of Tehran, Tehran, Iran

    Mojtaba Aghajani, Abbas Keramati & Babak Javadi

Authors
  1. Mojtaba Aghajani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abbas Keramati
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Babak Javadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mojtaba Aghajani.

Abbreviations

Abbreviations

CMS:

cellular manufacturing system

MINLP:

mixed-integer nonlinear programming

PSO:

particle swarm optimization

SA:

simulated annealing

JIT:

just-in-time

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aghajani, M., Keramati, A. & Javadi, B. Determination of number of kanban in a cellular manufacturing system with considering rework process. Int J Adv Manuf Technol 63, 1177–1189 (2012). https://doi.org/10.1007/s00170-012-3973-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-012-3973-y

Keywords

Search

Navigation