[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

A novel dynamic assignment rule for the distributed job shop scheduling problem using a hybrid ant-based algorithm

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Distributed scheduling problems are among the most investigated research topics in the fields of Operational Research, and represents one of the greatest challenges faced by industrialists and researchers today. The Distributed Job shop Scheduling Problem (DJSP) deals with the assignment of jobs to factories and with determining the sequence of operations on each machine in distributed manufacturing environments. The objective is to minimize the global makespan over all the factories. Since the problem is NP-hard to solve, one option to cope with this intractability is to use an approximation algorithm that guarantees near-optimal solutions quickly. Ant based algorithm has proved to be very effective and efficient in numerous scheduling problems, such as permutation flow shop scheduling, flexible job shop scheduling problems and network scheduling, etc. This paper proposes a hybrid ant colony algorithm combined with local search to solve the Distributed Job shop Scheduling Problem. A novel dynamic assignment rule of jobs to factories is also proposed. Furthermore, the Taguchi method for robust design is adopted for finding the optimum combination of parameters of the ant-based algorithm. To validate the performance of the proposed algorithm, intensive experiments are carried out on 480 large instances derived from well-known classical job-shop scheduling benchmarks. Also, we show that our algorithm can process up to 10 factories. The results prove the efficiency of the proposed algorithm in comparison with others.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Akjiratikarl C, Yenradee P, Drake PR (2007) Pso-based algorithm for home care worker scheduling in the uk. Comput Ind Eng 53(4):559–583

    Article  Google Scholar 

  2. Asadzadeh L, Zamanifar K (2010) An agent-based parallel approach for the job shop scheduling problem with genetic algorithms. Math Comput Model 52(11):1957–1965

    Article  MATH  Google Scholar 

  3. Balas E (1969) Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Oper Res 17 (6):941–957

    Article  MathSciNet  MATH  Google Scholar 

  4. Bell JE, McMullen PR (2004) Ant colony optimization techniques for the vehicle routing problem. Adv Eng Inform 18(1):41–48

    Article  Google Scholar 

  5. Blazewicz J, Ecker KH, Pesch E, Schmidt G, Weglarz J (1997) Scheduling computer and manufacturing processes. J Oper Res Soc 48(6):659–659

    Article  MATH  Google Scholar 

  6. Blum C, Sampels M (2004) An ant colony optimization algorithm for shop scheduling problems. J Math Model Algorithm 3(3):285–308

    Article  MathSciNet  MATH  Google Scholar 

  7. Brucker P, Brucker P (2007) Scheduling algorithms, vol 3. Springer, Berlin

    MATH  Google Scholar 

  8. Bullnheimer B, Hartl RF, Strauss C (1997) An improved ant system algorithm for the vehicle routing problem

  9. Carlier J, Pinson É (1989) An algorithm for solving the job-shop problem. Manag Sci 35(2):164–176

    Article  MathSciNet  MATH  Google Scholar 

  10. Chaouch I, Belkahla Driss O, Ghedira K (2017) A survey of optimization techniques for distributed job shop scheduling problems in multi-factories. In: Silhavy R, Senkerik R, Kominkova Oplatkova Z, Prokopova Z, Silhavy P (eds) Cybernetics and mathematics applications in intelligent systems. Springer International Publishing, Cham, pp 369–378

  11. Chen CL, Chen CL (2009) Bottleneck-based heuristics to minimize total tardiness for the flexible flow line with unrelated parallel machines. Comput Ind Eng 56(4):1393–1401

    Article  Google Scholar 

  12. Chen L, Bostel N, Dejax P, Cai J, Xi L (2007) A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal. Eur J Oper Res 181(1):40–58

    Article  MathSciNet  MATH  Google Scholar 

  13. Cheng BW, Chang CL (2007) A study on flowshop scheduling problem combining taguchi experimental design and genetic algorithm. Expert Syst Appl 32(2):415–421

    Article  Google Scholar 

  14. Chiang TC, Fu LC (2007) Using dispatching rules for job shop scheduling with due date-based objectives. Int J Prod Res 45(14):3245–3262

    Article  MATH  Google Scholar 

  15. Chong CS, Low MYH, Sivakumar AI, Gay KL (2006) A bee colony optimization algorithm to job shop scheduling. In: Proceedings of the 2006 winter simulation conference, pp 1954–1961

  16. Colorni A, Dorigo M, Maniezzo V (1991) Distributed optimization by ant colonies, actes de la première conférence européenne sur la vie artificielle (pp 134–142). Elsevier Publishing, France

    Google Scholar 

  17. Colorni A, Dorigo M, Maniezzo V, Trubian M (1994) Ant system for job-shop scheduling. Belg J Oper Res Stat Comput Sci 34(1):39–53

    MATH  Google Scholar 

  18. Cordon O, De Viana IF, Herrera F, Moreno L (2000) A new aco model integrating evolutionary computation concepts: The best-worst ant system

  19. Dorigo M (1992) Optimization learning and natural algorithms. PhD Thesis, Politecnico di Milano

  20. Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53–66

    Article  Google Scholar 

  21. Dorigo M, Maniezzo V, Colorni A, Maniezzo V (1991) Positive feedback as a search strategy

  22. Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern B Cybern 26(1):29–41

    Article  Google Scholar 

  23. Dowsland KA, Thompson JM (2008) An improved ant colony optimisation heuristic for graph colouring. Discret Appl Math 156(3):313–324

    Article  MathSciNet  MATH  Google Scholar 

  24. Eswaramurthy VP, Tamilarasi A (2009) Hybridizing tabu search with ant colony optimization for solving job shop scheduling problems. Int J Adv Manuf Technol 40(9):1004–1015

    Article  MATH  Google Scholar 

  25. French S (1982) Sequencing and scheduling, mathematics and its applications

  26. Gambardella LM, Taillard É, Agazzi G (1999) Macs-vrptw: A multiple colony system for vehicle routing problems with time windows. In: New ideas in optimization, Citeseer

  27. Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117–129

    Article  MathSciNet  MATH  Google Scholar 

  28. Gonçalves JF, de Magalhães Mendes JJ, Resende MG (2005) A hybrid genetic algorithm for the job shop scheduling problem. Eur J Oper Res 167(1):77–95

    Article  MathSciNet  MATH  Google Scholar 

  29. Gutjahr WJ, Rauner MS (2007) An aco algorithm for a dynamic regional nurse-scheduling problem in austria. Comput Oper Res 34(3):642–666

    Article  MATH  Google Scholar 

  30. Heinonen J, Pettersson F (2007) Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem. Appl Math Comput 187(2):989–998

    MathSciNet  MATH  Google Scholar 

  31. Hoitomt DJ, Luh PB, Pattipati KR (1993) A practical approach to job-shop scheduling problems. IEEE Trans Robot Autom 9(1):1–13. https://doi.org/10.1109/70.210791

    Article  Google Scholar 

  32. Jain AS, Meeran S (2002) A multi-level hybrid framework applied to the general flow-shop scheduling problem. Comput Oper Res 29(13):1873–1901

    Article  Google Scholar 

  33. Jayaraman V, Kulkarni B, Karale S, Shelokar P (2000) Ant colony framework for optimal design and scheduling of batch plants. Comput Chem Eng 24(8):1901–1912

    Article  Google Scholar 

  34. Jia H, Fuh J, Nee A, Zhang Y (2002) Web-based multi-functional scheduling system for a distributed manufacturing environment. Concurr Eng 10(1):27–39

    Article  Google Scholar 

  35. Jia H, Fuh J, Nee A, Zhang Y (2007) Integration of genetic algorithm and gantt chart for job shop scheduling in distributed manufacturing systems. Comput Ind Eng 53(2):313–320

    Article  Google Scholar 

  36. Jia HZ, Nee AYC, Fuh JYH, Zhang YF (2003) A modified genetic algorithm for distributed scheduling problems. J Intell Manuf 14(3):351–362

    Article  Google Scholar 

  37. Kamaruddin S, Khan ZA, Foong S (2010) Application of taguchi method in the optimization of injection moulding parameters for manufacturing products from plastic blend. Int J Eng Technol 2(6):574

    Article  Google Scholar 

  38. Lin TL, Horng SJ, Kao TW, Chen YH, Run RS, Chen RJ, Lai JL, Kuo IH (2010) An efficient job-shop scheduling algorithm based on particle swarm optimization. Expert Syst Appl 37(3):2629–2636

    Article  Google Scholar 

  39. Lu MS, Romanowski R (2012) Multi-contextual ant colony optimization of intermediate dynamic job shop problems. Int J Adv Manuf Technol 60(5):667–681

    Article  Google Scholar 

  40. Madahav SP (1989) Quality engineering using robust design. New Jersey

  41. Mahfouz A, Hassan SA, Arisha A (2010) Practical simulation application: Evaluation of process control parameters in twisted-pair cables manufacturing system. Simul Model Pract Theory 18(5):471–482

    Article  Google Scholar 

  42. Maniezzo V, Colorni A (1999) The ant system applied to the quadratic assignment problem. IEEE Trans Knowl Data Eng 11(5):769–778

    Article  Google Scholar 

  43. Muth JF, Thompson GL (1963) Industrial scheduling. Prentice-Hall

  44. Naderi B, Azab A (2014) Modeling and heuristics for scheduling of distributed job shops. Expert Syst Appl 41(17):7754–7763

    Article  Google Scholar 

  45. Naderi B, Azab A (2015) An improved model and novel simulated annealing for distributed job shop problems. Int J Adv Manuf Technol 81(1):693–703

    Article  Google Scholar 

  46. Nouri HE, Belkahla Driss O, Ghedira K (2016) Hybrid metaheuristics for scheduling of machines and transport robots in job shop environment. Appl Intell 45(3):808–828

    Article  Google Scholar 

  47. Panigrahi BK, Shi Y, Lim MH (2011) Handbook of swarm intelligence: concepts, principles and applications, vol 8. Springer Science & Business Media, Berlin

    Book  MATH  Google Scholar 

  48. Perez E, Posada M, Herrera F (2012) Analysis of new niching genetic algorithms for finding multiple solutions in the job shop scheduling. J Intell Manuf 23(3):341–356

    Article  Google Scholar 

  49. Pezzella F, Merelli E (2000) A tabu search method guided by shifting bottleneck for the job shop scheduling problem. Eur J Oper Res 120(2):297–310

    Article  MathSciNet  MATH  Google Scholar 

  50. Roy B, Sussmann B (1964) Problème d’ordonnancement avec contraintes disjonctives. Technical Report DS No 9

  51. Singha H, Kumarb P (2005) Optimizing cutting force for turned parts by taguchi’s parameter design approach. Indian J Eng Mater Sci 12:97–103

    Google Scholar 

  52. Stützle T, Hoos HH (2000) Max–min ant system. Futur Gener Comput Syst 16(8):889–914

    Article  MATH  Google Scholar 

  53. Sundar S, Suganthan PN, Jin CT, Xiang CT, Soon CC (2017) A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint. Soft Comput 21(5):1193–1202

    Article  Google Scholar 

  54. Suresh R, Mohanasundaram K (2006) Pareto archived simulated annealing for job shop scheduling with multiple objectives. Int J Adv Manuf Technol 29(1):184–196

    Article  Google Scholar 

  55. Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278–285

    Article  MathSciNet  MATH  Google Scholar 

  56. Talbi EG (2009) Metaheuristics: from design to implementation, vol 74. Wiley, New York

    Book  MATH  Google Scholar 

  57. Tan Y, Liu S, Wang D (2010) A constraint programming-based branch and bound algorithm for job shop problems. In: 2010 Chinese control and decision conference, pp 173–178

  58. Tanco M, Viles E, Pozueta L (2009) Comparing different approaches for design of experiments (DoE). Springer, Dordrecht, pp 611–621

    Google Scholar 

  59. Tasgetiren MF, Liang YC, Sevkli M, Gencyilmaz G (2006) Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem. Int J Prod Res 44(22):4737–4754

    Article  MATH  Google Scholar 

  60. Tay JC, Ho NB (2008) Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Comput Ind Eng 54(3):453–473

    Article  Google Scholar 

  61. Wang L, Zhou G, Xu Y, Liu M (2012) An enhanced pareto-based artificial bee colony algorithm for the multi-objective flexible job-shop scheduling. Int J Adv Manuf Technol 60(9):1111–1123

    Article  Google Scholar 

  62. Wang S, Liu M, Chu C (2015) A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling. Int J Prod Res 53(4):1143–1167

    Article  Google Scholar 

  63. Watanabe M, Ida K, Gen M (2005) A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem. Comput Ind Eng 48(4):743– 752

    Article  Google Scholar 

  64. Weckman GR, Ganduri CV, Koonce DA (2008) A neural network job-shop scheduler. J Intell Manuf 19(2):191–201

    Article  Google Scholar 

  65. Yao BZ, Yang CY, Hu JJ, Yin GD, Yu B (2010) An improved artificial bee colony algorithm for job shop problem. In: Applied mechanics and materials, trans tech publ, vol 26, pp 657–660

  66. Ying KC, Liao CJ (2004) An ant colony system for permutation flow-shop sequencing. Comput Oper Res 31(5):791–801

    Article  MATH  Google Scholar 

  67. Zhang R, Wu C (2010) A hybrid approach to large-scale job shop scheduling. Appl Intell 32(1):47–59

    Article  Google Scholar 

  68. Zhou R, Nee A, Lee H (2009) Performance of an ant colony optimisation algorithm in dynamic job shop scheduling problems. Int J Prod Res 47(11):2903–2920

    Article  MATH  Google Scholar 

  69. Zhou Y, Chen H, Zhou G (2014) Invasive weed optimization algorithm for optimization no-idle flow shop scheduling problem. Neurocomputing 137:285–292

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. COSMOS Laboratory, Université de la Manouba, Manouba, Tunisia

    Imen Chaouch, Olfa Belkahla Driss & Khaled Ghedira

  2. Ecole Nationale des Sciences de l’Informatique, Université de la Manouba, Manouba, Tunisia

    Imen Chaouch

  3. Ecole Supérieure de Commerce, Université de la Manouba, Manouba, Tunisia

    Olfa Belkahla Driss

  4. Institut Supérieur de Gestion de Tunis, Université de Tunis, Tunis, Tunisia

    Khaled Ghedira

Authors
  1. Imen Chaouch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Olfa Belkahla Driss
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Khaled Ghedira
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Imen Chaouch.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chaouch, I., Driss, O.B. & Ghedira, K. A novel dynamic assignment rule for the distributed job shop scheduling problem using a hybrid ant-based algorithm. Appl Intell 49, 1903–1924 (2019). https://doi.org/10.1007/s10489-018-1343-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-018-1343-7

Keywords

Search

Navigation