Coordination policy for production and delivery scheduling in the closed loop supply chain

Production Management
  • 7 Downloads

Abstract

Coordinating a supply chain necessitates a synchronization strategy for reordering products and a cost-effective production and replenishment cycle time. The aim of this paper is to present an optimization framework for producing and distribution in the supply chains with a cooperating strategy. The main contribution of this paper is to integrate closed loop supply chain with open-shop manufacturing and economic lot and delivery scheduling problem (ELDSP). This integration is applied with the aim of better coordination between the members of the supply chain. This study examines the ELDSP for a multi-stage closed loop supply chain, where each product is returned to a manufacturing center at a constant rate of demand. The supply chain is also characterized by a sub-open-shop system for remanufacturing returned items. Common cycle time and multiplier policies is adopted to accomplish the desired synchronization. For this purpose, we developed a mathematical model in which a manufacturer with an open-shop system purchases raw materials from suppliers, converts them into final products, and sends them to package companies. Given that the ELDSPR is an NP-hard problem, a simulated annealing (SA) algorithm and a biography-based optimization (BBO) algorithm is developed. Two operational scenarios are formulated for the simulated annealing algorithm, after which both the algorithms are used to solve problems of different scales. The numerical results show that the biography-based optimization algorithm excellently performs in finding the best solution to the ELDSPR.

Keywords

Lot and delivery scheduling Closed loop supply chain Open-shop system Common cycle Simulated annealing algorithm Biography-based optimization algorithm 

References

  1. 1.
    Osman H, Demirli K (2012) Economic lot and delivery scheduling problem for multi-stage supply chains. Int J Prod Econ 136(2):275–286CrossRefGoogle Scholar
  2. 2.
    Jensen MT, Khouja M (2004) An optimal polynomial time algorithm for the common cycle economic lot and delivery scheduling problem. Eur J Oper Res 156(2):305–311MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Torabi SA, Ghomi SF, Karimi B (2006) A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains. Eur J Oper Res 173(1):173–189MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Kim T, Hong Y, Chang SY (2006) Joint economic procurement—production–delivery policy for multiple items in a single-manufacturer, multiple-retailer system. Int J Prod Econ 103(1):199–208CrossRefGoogle Scholar
  5. 5.
    Sarker R, Newton C (2002) A genetic algorithm for solving economic lot size scheduling problem. Comput Ind Eng 42(2):189–198CrossRefGoogle Scholar
  6. 6.
    Bae H, Moon I, Yun W (2016) A time-varying lot sizes approach for the economic lot scheduling problem with returns. Int J Prod Res 54(11):3380–3396CrossRefGoogle Scholar
  7. 7.
    Hahm J, Yano CA (1995) The economic lot and delivery scheduling problem: Models for nested schedules. IIE Trans 27(2):126–139CrossRefGoogle Scholar
  8. 8.
    Khouja M (2000) The economic lot and delivery scheduling problem: common cycle, rework, and variable production rate. Iie Trans 32(8):715–725Google Scholar
  9. 9.
    Khouja M (2003) Synchronization in supply chains: implications for design and management. J Oper Res Soc 54(9):984–994CrossRefMATHGoogle Scholar
  10. 10.
    Lee W (2005) A joint economic lot size model for raw material ordering, manufacturing setup, and finished goods delivering. Omega 33(2):163–174CrossRefGoogle Scholar
  11. 11.
    Clausen J, Ju S (2006) A hybrid algorithm for solving the economic lot and delivery scheduling problem in the common cycle case. Eur J Oper Res 175(2):1141–1150CrossRefMATHGoogle Scholar
  12. 12.
    Torabi S, Jenabi M (2009) Multiple cycle economic lot and delivery-scheduling problem in a two-echelon supply chain. Int J Adv Manuf Technol 43(7):785–798CrossRefGoogle Scholar
  13. 13.
    Osman H, Demirli K (2010) A bilinear goal programming model and a modified Benders decomposition algorithm for supply chain reconfiguration and supplier selection. Int J Prod Econ 124(1):97–105CrossRefGoogle Scholar
  14. 14.
    Kai Chan H, Ho Chung S, Lim MK (2013) Recent research trend of economic-lot scheduling problems. J Manuf Technol Manag 24(3):465–482CrossRefGoogle Scholar
  15. 15.
    Dousthaghi S, Tavakkoli-Moghaddam R, Makui A (2013) Solving the economic lot and delivery scheduling problem in a flexible job shop with unrelated parallel machines and a shelf life by a proposed hybrid PSO. Int J Adv Manuf Technol 68(5–8):1401–1416CrossRefGoogle Scholar
  16. 16.
    Kuhn H, Liske T (2014) An exact algorithm for solving the economic lot and supply scheduling problem using a power-of-two policy. Comput Oper Res 51:30–40MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Taherkhani M, Seifbarghy M, Tavakkoli-Moghaddam R, Fattahi P (2017) Mixed-integer linear programming model for tree-like pipeline scheduling problem with intermediate due dates on demands. Oper Res Int J.  https://doi.org/10.1007/s12351-017-0329-2 Google Scholar
  18. 18.
    Konur D, Campbell JF, Monfared SA (2017) Economic and environmental considerations in a stochastic inventory control model with order splitting under different delivery schedules among suppliers. Omega 71:46–65CrossRefGoogle Scholar
  19. 19.
    Kia H, Ghodsypour SH, Davoudpour H (2017) A hybrid imperialist competitive algorithm for solving economic lot and delivery scheduling problem in a four-stage supply chain. Adv Mech Eng 9(2):1687814016686893CrossRefGoogle Scholar
  20. 20.
    Schmidt M, Schäfers P (2017) The Hanoverian Supply Chain Model: modelling the impact of production planning and control on a supply chain’s logistic objectives. Prod Eng Res Devel 11(4–5):487–493CrossRefGoogle Scholar
  21. 21.
    Rezaei S, Kheirkhah A (2017) Applying forward and reverse cross-docking in a multi-product integrated supply chain network. Prod Eng Res Devel 11(4–5):495–509CrossRefGoogle Scholar
  22. 22.
    Kirkpatrick S (1984) Optimization by simulated annealing: Quantitative studies. J Stat Phys 34(5):975–986MathSciNetCrossRefGoogle Scholar
  23. 23.
    Simon D (2008) Biogeography-based optimization. IEEE Trans Evol Comput 12(6):702–713CrossRefGoogle Scholar
  24. 24.
    Li L-L, Yang Y-F, Wang C-H, Lin K-P (2018) Biogeography-based optimization based on population competition strategy for solving the substation location problem. Expert Syst Appl 97:290–302CrossRefGoogle Scholar
  25. 25.
    Goli A, Aazami A, Jabbarzadeh A (2018) Accelerated cuckoo optimization algorithm for capacitated vehicle routing problem in competitive conditions. Int J Artif Intell 16(1):88–112Google Scholar

Copyright information

© German Academic Society for Production Engineering (WGP) 2018

Authors and Affiliations

  1. 1.Department of Industrial EngineeringYazd UniversityYazdIran
  2. 2.Department of Management, Dehaghan BranchIslamic Azad UniversityDehaghanIran

Personalised recommendations