Skip to main content

Advertisement

SpringerLink
Log in

Concurrent scheduling of jobs and AGVs in a flexible job shop system: a parallel hybrid PSO-GA meta-heuristic

  • Published:
Flexible Services and Manufacturing Journal Aims and scope Submit manuscript

Abstract

This research proposes a novel mixed integer linear programming (MILP) model along with a Parallel Hybrid PSO-GA Algorithm (PPSOGA) to address the simultaneous scheduling of jobs and Automated Guided Vehicles (AGVs) in a flexible job shop system. Wherein, finite multiple AGVs, alternative process routes, and job re-entry are considered. To the best of our knowledge, no study in the literature has highlighted the efficacy of parallel computing in the simultaneous scheduling of jobs and transporters in a flexible job shop system which remarkably reduces run-time. For this purpose, the suggested meta-heuristic is designed to be compatible with parallel computing and is compared against a number of well-known meta-heuristics (i.e., Genetic Algorithm, Particle Swarm Optimization, and Ant Colony Optimization) on a set of 40 benchmark instances generated using a combination of different distributions (i.e., uniform, exponential, and normal distributions). Employing two Tukey tests, the run-time means and the objective value means of all the suggested meta-heuristics are examined and compared against one another, the results of which emphasizes the superiority of the PPSOGA over all the other solution approaches in terms of the objective function’s value and run-time. Finally, it is discovered that even the sequential mode of the PPSOGA (i.e., the PSOGA) produces better objective values compared to other meta-heuristics.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Availability of data

Data are randomly generated.

References

  • Abdelmaguid TF, Nassef AO, Kamal BA, Hassan MF (2004) A hybrid ga/heuristic approach to the simultaneous scheduling of machines and automated guided vehicles. Int J Prod Res 42(2):267–281

    Article  MATH  Google Scholar 

  • Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manag Sci 34(3):391–401

    Article  MathSciNet  MATH  Google Scholar 

  • Ahmadi-Javid A, Hooshangi-Tabrizi P (2017) Integrating employee timetabling with scheduling of machines and transporters in a job-shop environment: a mathematical formulation and an anarchic society optimization algorithm. Comput Oper Res 84:73–91

    Article  MathSciNet  MATH  Google Scholar 

  • Anwar MF, Nagi R (1998) Integrated scheduling of material handling and manufacturing activities for just-in-time production of complex assemblies. Int J Prod Res 36(3):653–681

    Article  MATH  Google Scholar 

  • Asadzadeh L (2016) A parallel artificial bee colony algorithm for the job shop scheduling problem with a dynamic migration strategy. Comput Ind Eng 102:359–367

    Article  Google Scholar 

  • Bilge Ü, Ulusoy G (1995) A time window approach to simultaneous scheduling of machines and material handling system in an FMS. Oper Res 43(6):1058–1070

    Article  MATH  Google Scholar 

  • Bożejko W, Gnatowski A, Pempera J, Wodecki M (2017) Parallel tabu search for the cyclic job shop scheduling problem. Comput Ind Eng 113:512–524

    Article  Google Scholar 

  • Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41(3):157–183

    Article  MATH  Google Scholar 

  • Caumond A, Lacomme P, Moukrim A, Tchernev N (2009) An milp for scheduling problems in an FMS with one vehicle. Eur J Oper Res 199(3):706–722

    Article  MATH  Google Scholar 

  • Dabah A, Bendjoudi A, AitZai A, Taboudjemat NN (2019) Efficient parallel tabu search for the blocking job shop scheduling problem. Soft Comput 23(24):13283–13295

    Article  Google Scholar 

  • Dao T-K, Pan T-S, Pan J-S et al (2015) Parallel bat algorithm for optimizing makespan in job shop scheduling problems. J Intell Manuf 29(2):451–462

    Article  Google Scholar 

  • De Giovanni L, Pezzella F (2010) An improved genetic algorithm for the distributed and flexible job-shop scheduling problem. Eur J Oper Res 200(2):395–408

    Article  MATH  Google Scholar 

  • Deroussi L, Norre S (2010) Simultaneous scheduling of machines and vehicles for the flexible job shop problem. In: International conference on meta-heuristics and nature inspired computing. Djerba Island Tunisia, pp 1–2

  • Deroussi L, Gourgand M, Tchernev N (2008) A simple meta-heuristic approach to the simultaneous scheduling of machines and automated guided vehicles. Int J Prod Res 46(8):2143–2164

    Article  MATH  Google Scholar 

  • Drießel R, Mönch L (2012) An integrated scheduling and material-handling approach for complex job shops: a computational study. Int J Prod Res 50(20):5966–5985

    Article  Google Scholar 

  • Huang R-H, Yu T-H (2017) An effective ant colony optimization algorithm for multi-objective job-shop scheduling with equal-size lot-splitting. Appl Soft Comput 57:642–656

    Article  Google Scholar 

  • Hurink J, Knust S (2002) A tabu search algorithm for scheduling a single robot in a job-shop environment. Discret Appl Math 119(1–2):181–203

    Article  MathSciNet  MATH  Google Scholar 

  • Hurink J, Knust S (2005) Tabu search algorithms for job-shop problems with a single transport robot. Eur J Oper Res 162(1):99–111

    Article  MATH  Google Scholar 

  • Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN’95-international conference on neural networks, vol 4, IEEE, pp 1942–1948

  • Lacomme P, Larabi M, Tchernev N (2007) A disjunctive graph for the job-shop with several robots. In: MISTA conference, vol 20, pp 285–292

  • Lacomme P, Larabi M, Tchernev N (2013) Job-shop based framework for simultaneous scheduling of machines and automated guided vehicles. Int J Prod Econ 143(1):24–34

    Article  Google Scholar 

  • Li M, Lei D (2021) An imperialist competitive algorithm with feedback for energy-efficient flexible job shop scheduling with transportation and sequence-dependent setup times. Eng Appl Artif Intell 103:104307

    Article  Google Scholar 

  • Li J-Q, Deng J-W, Li C-Y, Han Y-Y, Tian J, Zhang B, Wang C-G (2020) An improved jaya algorithm for solving the flexible job shop scheduling problem with transportation and setup times. Knowl-Based Syst 200:106032

    Article  Google Scholar 

  • Liu Z, Guo S, Wang L (2019) Integrated green scheduling optimization of flexible job shop and crane transportation considering comprehensive energy consumption. J Clean Prod 211:765–786

    Article  Google Scholar 

  • Luo J, El Baz D, Xue R, Hu J (2020) Solving the dynamic energy aware job shop scheduling problem with the heterogeneous parallel genetic algorithm. Future Gener Comput Syst 108:119–134

    Article  Google Scholar 

  • Maroosi A, Muniyandi RC, Sundararajan E, Zin AM (2016) A parallel membrane inspired harmony search for optimization problems: a case study based on a flexible job shop scheduling problem. Appl Soft Comput 49:120–136

    Article  Google Scholar 

  • Mastrolilli M, Gambardella LM (2000) Effective neighbourhood functions for the flexible job shop problem. J Sched 3(1):3–20

    Article  MathSciNet  MATH  Google Scholar 

  • Nouri HE, Driss OB, Ghédira K (2016) Hybrid meta-heuristics for scheduling of machines and transport robots in job shop environment. Appl Intell 45(3):808–828

    Article  Google Scholar 

  • Pandit R (1993) Job shop scheduling with explicit material handling considerations. Working paper, Department of Mechanical and Industrial Engineering, University of Illinois at Urbana-Champaign, Urbana, IL

  • Raman N (1986) Simultaneous scheduling of machines and material handling devices in automated manufacturing. In: Proceedings of the first ORSA/TIMS conference on flexible manufacturing systems, Ann Arbor, MI’, pp 455–465

  • Sotskov YN, Shakhlevich NV (1995) Np-hardness of shop-scheduling problems with three jobs. Discret Appl Math 59(3):237–266

    Article  MathSciNet  MATH  Google Scholar 

  • Sun J, Zhang G, Lu J, Zhang W (2021) A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times. Comput Oper Res 132:105263

    Article  MathSciNet  MATH  Google Scholar 

  • Taguchi G (1986) Introduction to quality engineering: designing quality into products and processes, Technical report, sidalc.net

  • 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 

  • Tukey JW (1949) Comparing individual means in the analysis of variance. Biometrics, pp 99–114

  • Ulusoy G, Sivrikaya-Şerifoǧlu F, Bilge Ü (1997) A genetic algorithm approach to the simultaneous scheduling of machines and automated guided vehicles. Comput Oper Res 24(4):335–351

    Article  MathSciNet  MATH  Google Scholar 

  • Van Laarhoven PJ, Aarts EH, Lenstra JK (1992) Job shop scheduling by simulated annealing. Oper Res 40(1):113–125

    Article  MathSciNet  MATH  Google Scholar 

  • Zhang Q, Manier H, Manier M-A (2012) A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times. Comput Oper Res 39(7):1713–1723

    Article  MathSciNet  MATH  Google Scholar 

  • Zhang Q, Manier H, Manier M-A (2014) A modified shifting bottleneck heuristic and disjunctive graph for job shop scheduling problems with transportation constraints. Int J Prod Res 52(4):985–1002

    Article  Google Scholar 

  • Zhang G, Sun J, Lu X, Zhang H (2020) An improved memetic algorithm for the flexible job shop scheduling problem with transportation times. Meas Control 53(7–8):1518–1528

    Article  Google Scholar 

  • Zhang H, Xu G, Pan R, Ge H (2021) A novel heuristic method for the energy-efficient flexible job-shop scheduling problem with sequence-dependent set-up and transportation time. Eng Optim 1:1–22. https://doi.org/10.1080/0305215X.2021.1949007

    Article  Google Scholar 

Download references

Funding

Not applicable.

Author information

Authors and Affiliations

  1. Department of Mathematics, London School of Economics and Political Science (LSE), London, UK

    Arash Amirteimoori

  2. Faculty of Computing, Engineering and the Built Environment, Birmingham City University, Birmingham, UK

    Reza Kia

Authors
  1. Arash Amirteimoori
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Reza Kia
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Arash Amirteimoori.

Ethics declarations

Conflicts of interest

There are no Conflicts of interest.

Code availability

It is available in the format of Python coding language.

Ethics approval

All procedures performed in the study are in accordance with the ethical standards of the institutional and/or national research committee.

Consent to participate

All the authors formally confirm the participation consent in this research.

Consent for publication

All the authors formally confirm the unanimity on publishing this research.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Amirteimoori, A., Kia, R. Concurrent scheduling of jobs and AGVs in a flexible job shop system: a parallel hybrid PSO-GA meta-heuristic. Flex Serv Manuf J 35, 727–753 (2023). https://doi.org/10.1007/s10696-022-09453-y

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10696-022-09453-y

Keywords

Search

Navigation