Skip to main content

Advertisement

SpringerLink
Log in

A multi-objective mathematical model and evolutionary algorithm for the dual-resource flexible job-shop scheduling problem with sequencing flexibility

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

Abstract

In industry, skilled workers typically operate a specific set of machines; therefore, managers need to decide on the most efficient assignments for machines and workers. However, they also need to balance the workload among workers while meeting deadlines. In this research, the dual resource-constraint flexible job-shop scheduling problem with sequencing flexibility (DR-FJSPS) is formulated. The DR-FJSPS deals with decisions made regarding machines, worker assignments, and sequencing flexibility simultaneously in a flexible job-shop environment. Sequencing flexibility is studied in this paper, and precedence relationships of the operations are defined by a directed acyclic graph instead of the traditional linear order. The DR-FJSPS is modelled as a multi-objective problem to minimize conflicting objectives as makespan, maximal worker workload, and weighted tardiness. Due to the intractability of the DR-FJSPS, an elitist non-dominated sorting genetic algorithm (NSGA-II) with an innovative operator is developed to solve this problem efficiently. The algorithm provides a set of Pareto-optimal solutions that decision-makers can use to evaluate trade-offs between conflicting objectives. Tailor-made instances are introduced to demonstrate the applicability of the model and algorithm. A multi-random-start local search algorithm is developed to assess the effectiveness of the adapted NSGA-II. In addition to that, the multi-objective model is solved using the weighted sum approach. A comparison of the solutions demonstrates that the modified NSGA-II provides a non-dominated efficient set in a reasonable length of time. The benefits of the proposed solution methods, such as defining their everyday schedules, adapting schedules according to management needs, prioritization of makespan, on-time deliveries, and workers’ workload simultaneously, are highlighted.

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
Fig. 6

Adapted from Deb et al. (2002)

Fig. 7
Fig. 8

Adopted from Burke and Kendall (2005)

Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24

Similar content being viewed by others

Data availability

The datasets generated during and/or analysed during the current study are available in the OSF HOME repository, https://osf.io/m3jur/.

References

  • Ahmadi E, Zandieh M, Farrokh M, Emami SM (2016) A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms. Comput Oper Res 73:56–66

    Article  MathSciNet  MATH  Google Scholar 

  • Al-Hinai N, ElMekkawy TY (2011) An efficient hybridized genetic algorithm architecture for the flexible job shop scheduling problem. Flex Serv Manuf J 23:64–85. https://doi.org/10.1007/s10696-010-9067-y

    Article  Google Scholar 

  • Attia E-A, Duquenne P, Le-Lann J-M (2014) Considering skills evolutions in multi-skilled workforce allocation with flexible working hours. Int J Prod Res 52:4548–4573. https://doi.org/10.1080/00207543.2013.877613

    Article  Google Scholar 

  • Bagheri A, Zandieh M (2011) Bi-criteria flexible job-shop scheduling with sequence-dependent setup times—Variable neighborhood search approach. J Manuf Syst 30:8–15. https://doi.org/10.1016/j.jmsy.2011.02.004

    Article  Google Scholar 

  • Birgin EG, Feofiloff P, Fernandes CG, De Melo EL, Oshiro MT, Ronconi DP (2014) A MILP model for an extended version of the Flexible Job Shop Problem. Optimization Letters 8:1417–1431

    Article  MathSciNet  MATH  Google Scholar 

  • Birgin EG, Ferreira J, Ronconi DP (2015) List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility. Eur J Oper Res 247:421–440

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  • Brucker P, Schlie R (1990) Job-shop scheduling with multi-purpose machines. Computing 45:369–375. https://doi.org/10.1007/BF02238804

    Article  MathSciNet  MATH  Google Scholar 

  • Burke EK, Kendall G (2005) Search methodologies. Springer

    Book  MATH  Google Scholar 

  • Chaudhry IA, Khan AA (2016) A research survey: review of flexible job shop scheduling techniques. Int Trans Oper Res 23:551–591

    Article  MathSciNet  MATH  Google Scholar 

  • Chen H, Ihlow J, Lehmann C, (1999) A genetic algorithm for flexible job-shop scheduling, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C), pp.1120–1125 vol.1122. doi: https://doi.org/10.1109/ROBOT.1999.772512.

  • Chiang T-C, Lin H-J (2013) A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling. Int J Prod Econ 141:87–98

    Article  Google Scholar 

  • Cui Y, Meng J, Lu C (2018) Recent developments in China’s labor market: labor shortage, rising wages and their implications. Rev Dev Econ 22:1217–1238

    Article  Google Scholar 

  • Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6:182–197

    Article  Google Scholar 

  • Demir Y, Kürşat İşleyen S (2013) Evaluation of mathematical models for flexible job-shop scheduling problems. Appl Math Model 37:977–988. https://doi.org/10.1016/j.apm.2012.03.020

    Article  MathSciNet  MATH  Google Scholar 

  • Dhiflaoui M, Nouri HE, Driss OB (2018) Dual-resource constraints in classical and flexible job shop problems: a state-of-the-art review. Procedia Computer Sci 126:1507–1515

    Article  Google Scholar 

  • Ding H, Gu X (2020) Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem. Comput Oper Res 121:104951. https://doi.org/10.1016/j.cor.2020.104951

    Article  MathSciNet  MATH  Google Scholar 

  • ElMaraghy H, Monostori L, Schuh G, ElMaraghy W (2021) Evolution and future of manufacturing systems. CIRP Ann 70:635–658. https://doi.org/10.1016/j.cirp.2021.05.008

    Article  Google Scholar 

  • ElMaraghy H, Patel V, Abdallah IB (1999) A genetic algorithm based approach for scheduling of dual-resource constrainded manufacturing systems. CIRP Ann 48:369–372. https://doi.org/10.1016/S0007-8506(07)63204-1

    Article  Google Scholar 

  • ElMaraghy H, Patel V, Abdallah IB (2000) Scheduling of manufacturing systems under dual-resource constraints using genetic algorithms. J Manuf Syst 19:186

    Article  Google Scholar 

  • Ferjani A, Ammar A, Pierreval H, Elkosantini S (2017) A simulation-optimization based heuristic for the online assignment of multi-skilled workers subjected to fatigue in manufacturing systems. Comput Ind Eng 112:663–674. https://doi.org/10.1016/j.cie.2017.02.008

    Article  Google Scholar 

  • Fryer JS (1974) Organizational structure of dual-constraint job shops. Decis Sci 5:45–57

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Gong G, Chiong R, Deng Q, Han W, Zhang L, Lin W, Li K (2020) Energy-efficient flexible flow shop scheduling with worker flexibility. Expert Syst Appl 141:112902. https://doi.org/10.1016/j.eswa.2019.112902

    Article  Google Scholar 

  • Gong G, Deng Q, Gong X, Liu W, Ren Q (2018a) A new double flexible job-shop scheduling problem integrating processing time, green production, and human factor indicators. J Clean Prod 174:560–576

    Article  Google Scholar 

  • Gong X, Deng Q, Gong G, Liu W, Ren Q (2018b) A memetic algorithm for multi-objective flexible job-shop problem with worker flexibility. Int J Prod Res 56:2506–2522

    Article  Google Scholar 

  • Ivanov D, Tang CS, Dolgui A, Battini D, Das A (2021) Researchers’ perspectives on Industry 4.0: multi-disciplinary analysis and opportunities for operations management. Int J Prod Res 59:2055–2078. https://doi.org/10.1080/00207543.2020.1798035

    Article  Google Scholar 

  • Kacem I, Hammadi S, Borne P (2002) Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans Syst, Man, Cybern Part C (Appl Rev) 32:1–13

    Article  MATH  Google Scholar 

  • Kale IR, Kulkarni AJ (2018) Cohort intelligence algorithm for discrete and mixed variable engineering problems. Int J Parallel Emergent Distrib Syst 33:627–662. https://doi.org/10.1080/17445760.2017.1331439

    Article  Google Scholar 

  • Karthikeyan S, Asokan P, Nickolas S, Page T (2015) A hybrid discrete firefly algorithm for solving multi-objective flexible job shop scheduling problems. Int J Bio-Inspired Comput 7:386–401

    Article  Google Scholar 

  • Kher HV (2000) Examination of worker assignment and dispatching rules for managing vital customer priorities in dual resource constrained job shop environments. Comput Oper Res 27:525–537

    Article  MATH  Google Scholar 

  • Kulkarni AJ, Baki MF, Chaouch BA (2016) Application of the cohort-intelligence optimization method to three selected combinatorial optimization problems. Eur J Oper Res 250:427–447

    Article  MathSciNet  MATH  Google Scholar 

  • Lei D, Guo X (2014) Variable neighbourhood search for dual-resource constrained flexible job shop scheduling. Int J Prod Res 52:2519–2529

    Article  Google Scholar 

  • Lei D, Guo X (2015) An effective neighborhood search for scheduling in dual-resource constrained interval job shop with environmental objective. Int J Prod Econ 159:296–303

    Article  Google Scholar 

  • Li J-Q, Pan Q-K, Gao K-Z (2011) Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems. Int J Adv Manuf Technol 55:1159–1169

    Article  Google Scholar 

  • Li J-Q, Pan Q-K, Liang Y-C (2010) An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems. Comput Ind Eng 59:647–662

    Article  Google Scholar 

  • Li J-Q, Pan Q-K, Tasgetiren MF (2014) A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities. Appl Math Model 38:1111–1132. https://doi.org/10.1016/j.apm.2013.07.038

    Article  MathSciNet  MATH  Google Scholar 

  • Li X, Gao L (2016) An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int J Prod Econ 174:93–110

    Article  Google Scholar 

  • Li X, Zhu L, Baki F, Chaouch AB (2018) Tabu search and iterated local search for the cyclic bottleneck assignment problem. Comput Oper Res 96:120–130. https://doi.org/10.1016/j.cor.2018.04.004

    Article  MathSciNet  MATH  Google Scholar 

  • Mathews PG (2005) Design of Experiments with MINITAB. ASQ Quality Press Milwaukee, WI, USA

    Google Scholar 

  • Montgomery DC (2008) Design and analysis of experiments. Wiley

    Google Scholar 

  • Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the flexible job-shop scheduling problem. Comput Oper Res 35:3202–3212

    Article  MATH  Google Scholar 

  • Ray S, Jewkes EM (2004) Customer lead time management when both demand and price are lead time sensitive. Eur J Oper Res 153:769–781. https://doi.org/10.1016/S0377-2217(02)00655-0

    Article  MathSciNet  MATH  Google Scholar 

  • Treleven MD, Elvers DA (1985) An investigation of labor assignment rules in a dual-constrained job shop. J Oper Manag 6:51–68

    Article  Google Scholar 

  • Türkyılmaz A, Şenvar Ö, Ünal İ, Bulkan S (2020) A research survey: heuristic approaches for solving multi objective flexible job shop problems. J Intell Manuf 31:1949–1983. https://doi.org/10.1007/s10845-020-01547-4

    Article  Google Scholar 

  • Vital-Soto A, Azab A, Baki MF (2020) Mathematical modeling and a hybridized bacterial foraging optimization algorithm for the flexible job-shop scheduling problem with sequencing flexibility. J Manuf Syst 54:74–93. https://doi.org/10.1016/j.jmsy.2019.11.010

    Article  Google Scholar 

  • Wirojanagud P, Gel ES, Fowler JW, Cardy R (2007) Modelling inherent worker differences for workforce planning. Int J Prod Res 45:525–553. https://doi.org/10.1080/00207540600792242

    Article  Google Scholar 

  • Wu X, Peng J, Xiao X, Wu S (2021) An effective approach for the dual-resource flexible job shop scheduling problem considering loading and unloading. J Intell Manuf 32:707–728

    Article  Google Scholar 

  • Xie J, Gao L, Peng K, Li X, Li H (2019) Review on flexible job shop scheduling. IET Collab Intell Manuf 1:67–77

    Article  Google Scholar 

  • Xiong J, Xing L-N, Chen Y-W (2013) Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns. Int J Prod Econ 141:112–126

    Article  Google Scholar 

  • Xu J, Xu X, Xie S (2011) Recent developments in Dual Resource Constrained (DRC) system research. Eur J Oper Res 215:309–318

    Article  Google Scholar 

  • Zhang G, Shao X, Li P, Gao L (2009) An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput Ind Eng 56:1309–1318. https://doi.org/10.1016/j.cie.2008.07.021

    Article  Google Scholar 

  • Zheng X-L, Wang L (2016) A knowledge-guided fruit fly optimization algorithm for dual resource constrained flexible job-shop scheduling problem. Int J Prod Res. https://doi.org/10.1080/00207543.2016.1170226

    Article  Google Scholar 

  • Zhu Z, Zhou X (2020) An efficient evolutionary grey wolf optimizer for multi-objective flexible job shop scheduling problem with hierarchical job precedence constraints. Computers Indus Eng 140:106280

    Article  Google Scholar 

Download references

Funding

Funding for this research was provided by the Natural Sciences and Engineering Research Council of Canada (NSERC) and Cape Breton University (Start-Up Grant-4081046).

Author information

Authors and Affiliations

  1. Shannon School of Business, Cape Breton University, 1250 Grand Lake Rd, Sydney, NS, B1P 6L2, Canada

    Alejandro Vital-Soto

  2. Odette School of Business, University of Windsor, 401 Sunset Ave, Windsor, ON, N9B 3P4, Canada

    Mohammed Fazle Baki

  3. Production and Operations Management Research Lab, Department of Mechanical, Automotive, and Materials Engineering, Faculty of Engineering, University of Windsor, 401 Sunset Ave, Windsor, ON, N9B 3P4, Canada

    Ahmed Azab

Authors
  1. Alejandro Vital-Soto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammed Fazle Baki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ahmed Azab
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alejandro Vital-Soto.

Ethics declarations

Conflict of interest

The authors have no relevant financial or non-financial interests to disclose.

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

Vital-Soto, A., Baki, M.F. & Azab, A. A multi-objective mathematical model and evolutionary algorithm for the dual-resource flexible job-shop scheduling problem with sequencing flexibility. Flex Serv Manuf J 35, 626–668 (2023). https://doi.org/10.1007/s10696-022-09446-x

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10696-022-09446-x

Keywords

Search

Navigation