Skip to main content
SpringerLink
Log in

Dynamic dispatching priority setting in customer-oriented manufacturing environments

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

Abstract

In today’s competitive environment, customer-oriented view is essential in gaining sustainable competitive advantage. This study aims to reflect the customer-oriented view to production planning and control decisions. To this aim, a simulation optimization-based approach is developed for job shop systems with dynamic order arrivals. Product-type-based lot splitting is applied in order to improve the flow time, and machine-based dispatching rules are utilized for sublot scheduling to realize dynamic scheduling. Multiple customer segments with different importance weights and their expectations and penalties on order completion rate on due date, tardiness, and earliness are considered. A customer satisfaction-based objective function is defined. Customer-oriented dispatching rules are proposed in this study to ensure the prioritization of orders from the key customers in order fulfilling. In order to prevent customer losses by providing a balanced structure between the customer segments in terms of the satisfaction levels, weight setting functions that dynamically compute the weights in the proposed dispatching rules are proposed. It is aimed to determine the near-optimal values of the segment-based parameters of the related weight setting functions. To this aim, a differential evolution algorithm-based simulation optimization approach is proposed. To confirm its viability, the proposed approach is applied to a realistic job shop system.

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. Paiva EL (2010) Manufacturing and marketing integration from a cumulative capabilities perspective. Int J Prod Econ 126(2):379–386

    Article  Google Scholar 

  2. Güçdemir H, Selim H (2015a) Integrating multi-criteria decision making and clustering for business customer segmentation. Ind Manag Data Syst 115(6):1022–1040

    Article  Google Scholar 

  3. Calleja G, Pastor R (2014) A dispatching algorithm for flexible job shop scheduling with transfer batches: an industrial application. Prod Plan Cont 25(2):93–109

    Article  Google Scholar 

  4. Xiang W, Song F, Ye F (2014) Order allocation for multiple supply-demand networks within a cluster. J Intell Manuf 25(6):1367–1376

    Article  Google Scholar 

  5. Sobeyko O, Mönch L (2016) Heuristic approaches for scheduling jobs in large-scale flexible job shops. Comp Oper Res 68:97–109

    Article  MathSciNet  MATH  Google Scholar 

  6. Vaessens RJM, Aarts EH, Lenstra JK (1996) Job shop scheduling by local search. INFORMS J on Comput 8(3):302–317

    Article  MATH  Google Scholar 

  7. Gupta AK, Sivakumar AI (2006) Job shop scheduling techniques in semiconductor manufacturing. Int J Adv Manuf Technol 27(11–12):1163–1169

    Article  Google Scholar 

  8. Çaliş B, Bulkan S (2015) A research survey: review of AI solution strategies of job shop scheduling problem. J Intell Manuf 26(5):961–973

    Article  Google Scholar 

  9. Sharma P, Jain A (2016) A review on job shop scheduling with setup times. Proceed of the Inst of Mech Eng, Part B: J Eng Manuf 230(3):517–533

    Article  Google Scholar 

  10. Zhou R, Nee AYC, Lee HP (2009) Performance of an ant colony optimization algorithm in dynamic job shop scheduling problems. Int J Prod Res 47(11):2903–2920

    Article  MATH  Google Scholar 

  11. Renna P (2010) Job shop scheduling by pheromone approach in a dynamic environment. Int J Comput Integ Manuf 23(5):412–424

    Article  Google Scholar 

  12. Chryssolouris G, Subramaniam V (2001) Dynamic scheduling of manufacturing job shops using genetic algorithms. J Intell Manuf 12(3):281–293

    Article  Google Scholar 

  13. Liu SQ, Ong HL, Ng KM (2005) Metaheurisitcs for minimizing the makespan of the dynamic job shop scheduling problem. Adv in Eng Softw 36(3):199–205

    Article  MATH  Google Scholar 

  14. Zhang L, Gao L, Li X (2013a) A hybrid genetic algorithm and tabu search for multi-objective dynamic job shop scheduling problem. Int J Prod Res 51(12):3516–3531

    Article  Google Scholar 

  15. Zhang L, Gao L, Li X (2013b) A hybrid intelligent algorithm and rescheduling technique for job shop scheduling problems with disruptions. Int J Adv Manuf Tech 65(5–8):1141–1156

    Article  Google Scholar 

  16. Wang S, Xiao X, Li F, Wang C (2010) Applied research of improved hybrid discrete PSO for dynamic job-shop scheduling problem. In: Proceed of the IEEE conf on Intel Cont and Auto 4065–4068

  17. Korytkowski P, Wisniewski T, Rymaszewski S (2013) An evolutionary simulation-based optimization approach for dispatching scheduling. Simul Mod Prac Theor 35:69–85

    Article  Google Scholar 

  18. Blackstone JH, Phillips DT, Hogg GL (1982) A state-of-the-art survey of dispatching rules for manufacturing job shop operations. Int J Prod Res 20(1):27–45

    Article  Google Scholar 

  19. Rochette R, Sadowski RP (1976) A statistical comparison of the performance of simple dispatching rules for a particular set of job shops. Int J Prod Res 14(1):63–75

    Article  Google Scholar 

  20. Haupt R (1989) A survey of priority rule-based scheduling. OR Spectr 11(1):3–16

    Article  MathSciNet  MATH  Google Scholar 

  21. Montazer M, Van Wassenhove L (1990) Analysis of scheduling rules for an FMS. Int J Prod Res 28(4):785–802

    Article  Google Scholar 

  22. Pinedo ML (2008) Scheduling—theory, algorithms, and systems. Springer, New York

    MATH  Google Scholar 

  23. Suwa H, Sandoh H (2012) Online scheduling in manufacturing: a cumulative delay approach. Springer, London

    MATH  Google Scholar 

  24. Kaban AK, Othman Z, Rohmah DS (2012) Comparison of dispatching rules in job-shop scheduling problem using simulation: a case study. Int J Simul Model 11(3):129–140

    Article  Google Scholar 

  25. Rajendran C, Holthaus O (1999) A comparative study of dispatching rules in dynamic flowshops and job shops. Eur J Oper Res 116(1):156–170

    Article  MATH  Google Scholar 

  26. Chen X, Wen Lin H, Murata T (2012) Composite dispatching rule design for dynamic scheduling with customer-oriented production priority control. IEEJ T Electr Electro Eng 7(1):53–61

    Article  Google Scholar 

  27. Malhotra MK, Jensen JB, Philipoom PR (1994) Management of vital customer priorities in job shop manufacturing environments. Decis Sci 25(5–6):711–736

    Article  Google Scholar 

  28. Jensen JB, Philipoom PR, Malhotra MK (1995) Evaluation of scheduling rules with commensurate customer priorities in job shops. J Oper Manag 13(3):213–228

    Article  Google Scholar 

  29. Natarajan K, Mohanasundaram KM, Babu BS et al (2007) Performance evaluation of priority dispatching rules in multi-level assembly job shops with jobs having weights for flowtime and tardiness. Int J Adv Manuf Technol 31(7–8):751–761

    Google Scholar 

  30. Ramkumar R, Tamilarasi A, Devi T (2011) Multi criteria job shop schedule using fuzzy logic control for multiple machines multiple jobs. Int J Comp Theor Eng 3(2):282–286

    Article  Google Scholar 

  31. Chen B, Matis TI (2013) A flexible dispatching rule for minimizing tardiness in job shop scheduling. Int J Prod Econ 141:360–365

    Article  Google Scholar 

  32. Zhong RY, Huang GQ, Lan S, Dai Q, Zhang T, Xu C (2015) A two-level advanced production planning and scheduling model for RFID-enabled ubiquitous manufacturing. Adv Eng Infor 29:799–812

    Article  Google Scholar 

  33. Edis R, Ornek A (2009) Simulation analysis of lot streaming in job shops with transportation queue disciplines. Simul Model Pract and Theo 17(2):442–453

    Article  Google Scholar 

  34. Cheng M, Mukherjee NJ, Sarin SC (2013) A review of lot streaming. Int J Prod Res 51(23–24):7023–7046

    Article  Google Scholar 

  35. Storn R, Price K (1995) Differential evolution—a simple and efficient adaptive scheme for global optimization over continuous spaces. Tech Report TR-95-012. Int Comput Sci Inst, Berkley, CA

  36. Karaboğa D, Ökdem S (2004) A simple and global optimization algorithm for engineering problems: differential evolution algorithm. Tur J Electr Eng Comput Sciences 12(1):53–60

    Google Scholar 

  37. Tasgetiren MF, Suganthan PN, Pan QK (2010) An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem. App Math Comput 215(9):3356–3368

    Article  MathSciNet  MATH  Google Scholar 

  38. Mingyong L, Erbao C (2010) An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows. Eng App Artif Intell 23(2):188–195

    Article  Google Scholar 

  39. Lieckens K, Vandaele N (2007) Reverse logistics network design with stochastic lead times. Comp Oper Res 34(2):395–416

    Article  MATH  Google Scholar 

  40. Subulan K, Baykasoğlu A, Eren Akyol D, Yildiz G (2016) Metaheuristic-based simulation optimization approach to network revenue management with an improved self-adjusting bid price function. Eng Econ. doi:10.1080/0013791X.2016.1174323

    Google Scholar 

  41. Das S, Suganthan PN (2011) Differential evolution: a survey of the state-of-the-art. IEEE T Evol Comput 15(1):4–31

    Article  Google Scholar 

  42. Amaran S, Sahinidis VN, Sharda B, Burry SJ (2016) Simulation optimization: a review of algorithms and applications. Annals of Oper Res 240(1):351–380

    Article  MathSciNet  MATH  Google Scholar 

  43. Swisher JR, Hyden PD, Jacobson SH, Schruben LW (2000) A survey of simulation optimization techniques and procedures. In: Proceed of the Winter Simul Conf, Orlando, USA, 119–128

  44. Carson Y, Maria A (1997) Simulation optimization: methods and applications. In: Proceed of the Winter Simul Conf, Atlanta, USA, 118–126

  45. Güçdemir H, Selim H (2015b) Simulation optimization approach for customer centric lot streaming problem in job shops. In: Proceed of the Int Conf on Model, Simul and App Opt, Istanbul, Turkey, 1–6

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Manisa Celal Bayar University, Muradiye Campus, 45140, Manisa, Turkey

    Hülya Güçdemir

  2. Department of Industrial Engineering, Dokuz Eylul University, Tınaztepe Campus, 35397, Izmir, Turkey

    Hasan Selim

Authors
  1. Hülya Güçdemir
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hasan Selim
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hülya Güçdemir.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Güçdemir, H., Selim, H. Dynamic dispatching priority setting in customer-oriented manufacturing environments. Int J Adv Manuf Technol 92, 1861–1874 (2017). https://doi.org/10.1007/s00170-017-0258-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-017-0258-5

Keywords

Search

Navigation