Skip to main content

Advertisement

SpringerLink
Log in

Unrelated parallel batch processing machine scheduling for production systems under carbon reduction policies: NSGA-II and MOGWO metaheuristics

  • Soft computing in decision making and in modeling in economics
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

In recent years, the problem of extensive energy consumption and carbon emission in manufacturing companies has been highlighted. Efficient scheduling strategies can help governments and production managers to control the raised environmental concerns resulting from this problem. The goal of this research is to address a green scheduling problem for unrelated parallel batch processes, as a group of highly energy-intensive machines, by considering the emission reduction regulation for the first time. To this aim, two new cases of unrelated parallel batch processing machine scheduling problems under the tax and cap-and-trade policies are defined. The problems are formulated using a mixed-integer linear mathematical model, where the goal is to minimize the makespan and total cost of the production system simultaneously. The total cost objective function includes the earliness and tardiness penalties, machine purchasing costs, and carbon emission costs. Also, several other features, such as setup time, release time, and the machines' purchasing decisions, are considered to provide a more realistic framework. As a solution approach, an interactive fuzzy programming method is presented to establish the single-objective counterpart of the models. Moreover, regarding the complexity of the problem, non-dominated sorting genetic algorithm-II (NSGA-II) and multiobjective gray wolf optimizer (MOGWO) algorithms are utilized as two multiobjective metaheuristics algorithms for large-size instances, for which the parameters are calibrated using the Taguchi design of experiments. Extensive analyses are established by solving several numerical instances. The outputs prove the superiority of the presented framework compared to the traditional models. The results also demonstrate that the newly developed cases can reduce the total cost of the production system by about 5.87 and 0.56% under the tax and cap-and-trade regulations, respectively. Besides, the statistical analysis of the results shows that NSGA-II outperforms the MOGWO algorithm for both cases.

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
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18

Similar content being viewed by others

Availability of data and materials

Not applicable.

Notes

  1. www.statista.com.

References

  • Abedi M, Seidgar H, Fazlollahtabar H, Bijani R (2015) Bi-objective optimisation for scheduling the identical parallel batch-processing machines with arbitrary job sizes, unequal job release times and capacity limits. Int J Prod Res 53(6):1680–1711

    Google Scholar 

  • Akbar M, Irohara T (2018) Scheduling for sustainable manufacturing: a review. J Clean Prod 205:866–883

    Google Scholar 

  • Amani Bani E, Fallahi A, Varmazyar M, Fathi M (2022) Designing a sustainable reverse supply chain network for COVID-19 vaccine waste under uncertainty. Comput Ind Eng 174:108808

    Google Scholar 

  • Arroyo JEC, Leung JY-T (2017a) An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times. Comput Ind Eng 105:84–100

    Google Scholar 

  • Arroyo JEC, Leung JY-T (2017b) Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times. Comput Oper Res 78:117–128

    MathSciNet  MATH  Google Scholar 

  • Asadkhani J, Fallahi A, Mokhtari H (2022) A sustainable supply chain under VMI-CS agreement with withdrawal policies for imperfect items. J Clean Prod 376:134098

    Google Scholar 

  • Audet C, Bigeon J, Cartier D, Le Digabel S, Salomon L (2021) Performance indicators in multiobjective optimization. Eur J Oper Res 292(2):397–422

    MathSciNet  MATH  Google Scholar 

  • Bilyk A, Mönch L (2012) A variable neighborhood search approach for planning and scheduling of jobs on unrelated parallel machines. J Intell Manuf 23(5):1621–1635

    Google Scholar 

  • Chang P-Y, Damodaran P, Melouk S (2004) Minimizing makespan on parallel batch processing machines. Int J Prod Res 42(19):4211–4220

    Google Scholar 

  • Cheng B, Wang Q, Yang S, Hu X (2013) An improved ant colony optimization for scheduling identical parallel batching machines with arbitrary job sizes. Appl Soft Comput 13(2):765–772

    Google Scholar 

  • Cheng J, Chu F, Chu C, Xia W (2016) Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices. RAIRO-Oper Res 50(4–5):715–732

    MathSciNet  MATH  Google Scholar 

  • Chouhan VK, Khan SH, Hajiaghaei-Keshteli M (2021) Metaheuristic approaches to design and address multi-echelon sugarcane closed-loop supply chain network. Soft Comput 25(16):11377–11404

    Google Scholar 

  • Costa CB, Maciel MRW, Maciel Filho R (2005) Factorial design technique applied to genetic algorithm parameters in a batch cooling crystallization optimisation. Comput Chem Eng 29(10):2229–2241

    Google Scholar 

  • Damodaran P, Diyadawagamage DA, Ghrayeb O, Vélez-Gallego MC (2012) A particle swarm optimization algorithm for minimizing makespan of nonidentical parallel batch processing machines. Int J Adv Manuf Technol 58(9):1131–1140

    Google Scholar 

  • Damodaran P, Hirani NS, Velez-Gallego MC (2009) Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms. Eur J Ind Eng 3(2):187–206

    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(2):182–197

    Google Scholar 

  • Ding J-Y, Song S, Wu C (2016) Carbon-efficient scheduling of flow shops by multi-objective optimization. Eur J Oper Res 248(3):758–771

    MathSciNet  MATH  Google Scholar 

  • Fallahi A, Bani EA, Niaki STA (2022a) A constrained multi-item EOQ inventory model for reusable items: reinforcement learning-based differential evolution and particle swarm optimization. Expert Syst Appl 207:118018

    Google Scholar 

  • Fallahi A, Mahnam M, Niaki STA (2022b) A discrete differential evolution with local search particle swarm optimization to direct angle and aperture optimization in IMRT treatment planning problem. Appl Soft Comput 131:109798

    Google Scholar 

  • Fallahi A, Mousavian Anaraki SA, Mokhtari H, Niaki STA (2022c) Blood plasma supply chain planning to respond COVID-19 pandemic: a case study. Environ Dev Sustain. https://doi.org/10.1007/s10668-022-02793-7

  • Fang K, Uhan N, Zhao F, Sutherland JW (2011) A new approach to scheduling in manufacturing for power consumption and carbon footprint reduction. J Manuf Syst 30(4):234–240

    Google Scholar 

  • Foumani M, Smith-Miles K (2019) The impact of various carbon reduction policies on green flowshop scheduling. Appl Energy 249:300–315

    Google Scholar 

  • Fowler JW, Mönch L (2022) A survey of scheduling with parallel batch (p-batch) processing. Eur J Oper Res 298(1):1–24

    MathSciNet  MATH  Google Scholar 

  • Gahm C, Denz F, Dirr M, Tuma A (2016) Energy-efficient scheduling in manufacturing companies: a review and research framework. Eur J Oper Res 248(3):744–757

    MathSciNet  MATH  Google Scholar 

  • Giret A, Trentesaux D, Prabhu V (2015) Sustainability in manufacturing operations scheduling: a state of the art review. J Manuf Syst 37:126–140

    Google Scholar 

  • Goli A, Ala A, Hajiaghaei-Keshteli M (2023) Efficient multi-objective meta-heuristic algorithms for energy-aware non-permutation flow-shop scheduling problem. Expert Syst Appl 213:119077

    Google Scholar 

  • Golshahi-Roudbaneh A, Hajiaghaei-Keshteli M, Paydar M (2021) Cross-dock scheduling considering time windows and deadline for truck departures. Sci Iran 28(1):532–546

    Google Scholar 

  • Haeri A, Hosseini-Motlagh S-M, Samani MRG, Rezaei M (2022) An integrated socially responsible-efficient approach toward health service network design. Ann Oper Res 319(1):463–516

    MathSciNet  MATH  Google Scholar 

  • Hamid M, Hamid M, Musavi M, Azadeh A (2019) Scheduling elective patients based on sequence-dependent setup times in an open-heart surgical department using an optimization and simulation approach. SIMULATION 95(12):1141–1164

    Google Scholar 

  • Ikura Y, Gimple M (1986) Efficient scheduling algorithms for a single batch processing machine. Oper Res Lett 5(2):61–65

    MathSciNet  MATH  Google Scholar 

  • Ji B, Xiao X, Yu SS, Wu G (2023) A hybrid large neighborhood search method for minimizing makespan on unrelated parallel batch processing machines with incompatible job families. Sustainability 15(5):3934

    Google Scholar 

  • Jia Z-H, Wang Y, Wu C, Yang Y, Zhang X-Y, Chen H-P (2019) Multi-objective energy-aware batch scheduling using ant colony optimization algorithm. Comput Ind Eng 131:41–56

    Google Scholar 

  • Jula P, Leachman RC (2010) Coordinated multistage scheduling of parallel batch-processing machines under multiresource constraints. Oper Res 58(4-part-1):933–947

    MathSciNet  MATH  Google Scholar 

  • Kashan AH, Karimi B, Jolai F (2010) An effective hybrid multi-objective genetic algorithm for bi-criteria scheduling on a single batch processing machine with non-identical job sizes. Eng Appl Artif Intell 23(6):911–922

    Google Scholar 

  • Kashan AH, Ozturk O (2022) Improved MILP formulation equipped with valid inequalities for scheduling a batch processing machine with non-identical job sizes. Omega 112:102673

    Google Scholar 

  • Keshavarz T, Salmasi N, Varmazyar M (2019) Flowshop sequence-dependent group scheduling with minimisation of weighted earliness and tardiness. Eur J Ind Eng 13(1):54–80

    Google Scholar 

  • Lee C-Y (1999) Minimizing makespan on a single batch processing machine with dynamic job arrivals. Int J Prod Res 37(1):219–236

    MATH  Google Scholar 

  • Li X, Huang Y, Tan Q, Chen H (2013) Scheduling unrelated parallel batch processing machines with non-identical job sizes. Comput Oper Res 40(12):2983–2990

    MathSciNet  MATH  Google Scholar 

  • Li Y, Huang W, Wu R, Guo K (2020) An improved artificial bee colony algorithm for solving multi-objective low-carbon flexible job shop scheduling problem. Appl Soft Comput 95:106544

    Google Scholar 

  • Liu C-H, Huang D-H (2014) Reduction of power consumption and carbon footprints by applying multi-objective optimisation via genetic algorithms. Int J Prod Res 52(2):337–352

    Google Scholar 

  • Makhadmeh SN, Alomari OA, Mirjalili S, Al-Betar MA, Elnagar A (2022) Recent advances in multi-objective grey wolf optimizer, its versions and applications. Neural Comput Appl 34(22):19723–19749

    Google Scholar 

  • Mathirajan M, Sivakumar AI (2006) A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. Int J Adv Manuf Technol 29(9–10):990–1001

    Google Scholar 

  • Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46–61

    Google Scholar 

  • Mirjalili S, Saremi S, Mirjalili SM, Coelho L, d. S. (2016) Multi-objective grey wolf optimizer: a novel algorithm for multi-criterion optimization. Expert Syst Appl 47:106–119

    Google Scholar 

  • Mokhtari H, Hasani A (2017) An energy-efficient multi-objective optimization for flexible job-shop scheduling problem. Comput Chem Eng 104:339–352

    Google Scholar 

  • Mousavi M, Hajiaghaei-Keshteli M, Tavakkoli-Moghaddam R (2020) Two calibrated meta-heuristics to solve an integrated scheduling problem of production and air transportation with the interval due date. Soft Comput 24(21):16383–16411

    Google Scholar 

  • Najafi AA, Niaki STA, Shahsavar M (2009) A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations. Comput Oper Res 36(11):2994–3001

    MATH  Google Scholar 

  • Nikoubin A, Mahnam M, Moslehi G (2023) A relax-and-fix Pareto-based algorithm for a bi-objective vaccine distribution network considering a mix-and-match strategy in pandemics. Appl Soft Comput 132:109862

    Google Scholar 

  • Ning T, Huang Y (2023) Low carbon emission management for flexible job shop scheduling: a study case in China. J Ambient Intell Humaniz Comput 14(2):789–805

  • Ning T, Wang Z, Zhang P, Gou T (2020) Integrated optimization of disruption management and scheduling for reducing carbon emission in manufacturing. J Clean Prod 263:121449

    Google Scholar 

  • Noori-Darvish S, Mahdavi I, Mahdavi-Amiri N (2012) A bi-objective possibilistic programming model for open shop scheduling problems with sequence-dependent setup times, fuzzy processing times, and fuzzy due dates. Appl Soft Comput 12(4):1399–1416

    Google Scholar 

  • Pakzad-Moghaddam S (2016) A Lévy flight embedded particle swarm optimization for multi-objective parallel-machine scheduling with learning and adapting considerations. Comput Ind Eng 91:109–128

    Google Scholar 

  • Parsa NR, Karimi B, Kashan AH (2010) A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes. Comput Oper Res 37(10):1720–1730

    MathSciNet  MATH  Google Scholar 

  • Pasandideh SHR, Niaki STA, Yeganeh JA (2010) A parameter-tuned genetic algorithm for multi-product economic production quantity model with space constraint, discrete delivery orders and shortages. Adv Eng Softw 41(2):306–314

    MATH  Google Scholar 

  • Pinedo ML (2012) Scheduling, vol 29. Springer, Berlin

    MATH  Google Scholar 

  • Potts CN, Kovalyov MY (2000) Scheduling with batching: A review. Eur J Oper Res 120(2):228–249

    MathSciNet  MATH  Google Scholar 

  • Queiroga E, Pinheiro RG, Christ Q, Subramanian A, Pessoa AA (2021) Iterated local search for single machine total weighted tardiness batch scheduling. J Heuristics 27(3):353–438

    Google Scholar 

  • Rahimi I, Gandomi AH, Deb K, Chen F, Nikoo MR (2022) Scheduling by NSGA-II: review and bibliometric analysis. Processes 10(1):98

    Google Scholar 

  • Sadati A, Tavakkoli-Moghaddam R, Naderi B, Mohammadi M (2019) A bi-objective model for a scheduling problem of unrelated parallel batch processing machines with fuzzy parameters by two fuzzy multi-objective meta-heuristics. Iran J Fuzzy Syst 16(4):21–40

    Google Scholar 

  • Sadeghi AH, Amani Bani E, Fallahi A, Handfield R (2023) Grey wolf optimizer and whale optimization algorithm for stochastic inventory management of reusable products in a two-level supply chain. IEEE Access

  • Schott JR (1995) Fault tolerant design using single and multicriteria genetic algorithm optimization. Massachusetts Institute of Technology

  • Shadrokh S, Kianfar F (2007) A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty. Eur J Oper Res 181(1):86–101

    MathSciNet  MATH  Google Scholar 

  • Shahidi-Zadeh B, Tavakkoli-Moghaddam R, Taheri-Moghadam A, Rastgar I (2017) Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study. Comput Oper Res 88:71–90

    MathSciNet  MATH  Google Scholar 

  • Shahmoradi-Moghadam H, Schönberger J (2021) Coordinated allocation production routing problem for mobile supply chains with shared factories. Comput Chem Eng 155:107501

    Google Scholar 

  • Shahnaghi K, Shahmoradi-Moghadam H, Noroozi A, Mokhtari H (2016) A robust modelling and optimisation framework for a batch processing flow shop production system in the presence of uncertainties. Int J Comput Integr Manuf 29(1):92–106

    Google Scholar 

  • Srinivas N, Deb K (1994) Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2(3):221–248

    Google Scholar 

  • Suhaimi N, Nguyen C, Damodaran P (2016) Lagrangian approach to minimize makespan of non-identical parallel batch processing machines. Comput Ind Eng 101:295–302

    Google Scholar 

  • Tavakkoli-Moghaddam R, Rahimi-Vahed A, Mirzaei AH (2007) A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness. Inf Sci 177(22):5072–5090

    MathSciNet  MATH  Google Scholar 

  • Tirkolaee EB, Goli A, Ghasemi P, Goodarzian F (2022) Designing a sustainable closed-loop supply chain network of face masks during the COVID-19 pandemic: Pareto-based algorithms. J Clean Prod 333:130056

    Google Scholar 

  • Torabi SA, Hassini E (2008) An interactive possibilistic programming approach for multiple objective supply chain master planning. Fuzzy Sets Syst 159(2):193–214

    MathSciNet  MATH  Google Scholar 

  • Van Veldhuizen DA (1999) Multiobjective evolutionary algorithms: classifications, analyses, and new innovations. Air Force Institute of Technology

  • Varmazyar M, Akhavan-Tabatabaei R, Salmasi N, Modarres M (2020) Operating room scheduling problem under uncertainty: Application of continuous phase-type distributions. IISE Transactions 52(2):216–235

    Google Scholar 

  • Varmazyar M, Salmasi N (2012) Sequence-dependent flow shop scheduling problem minimising the number of tardy jobs. Int J Prod Res 50(20):5843–5858

    Google Scholar 

  • Wang L, Ng AH, Deb K (2011) Multi-objective evolutionary optimisation for product design and manufacturing. Springer, Berlin

    Google Scholar 

  • Wang S, Liu M, Chu F, Chu C (2016) Bi-objective optimization of a single machine batch scheduling problem with energy cost consideration. J Clean Prod 137:1205–1215

    Google Scholar 

  • Wang Y, Jia Z-H, Li K (2021) A multi-objective co-evolutionary algorithm of scheduling on parallel non-identical batch machines. Expert Syst Appl 167:114145

    Google Scholar 

  • Wu X, Cao Z (2022) An improved multi-objective evolutionary algorithm based on decomposition for solving re-entrant hybrid flow shop scheduling problem with batch processing machines. Comput Ind Eng 169:108236

  • Xiao X, Ji B, Yu SS, Wu G (2023) A tabu-based adaptive large neighborhood search for scheduling unrelated parallel batch processing machines with non-identical job sizes and dynamic job arrivals. Flex Serv Manuf J. https://doi.org/10.1007/s10696-023-09488-9

  • Xu R, Chen H, Li X (2013) A bi-objective scheduling problem on batch machines via a Pareto-based ant colony system. Int J Prod Econ 145(1):371–386

    Google Scholar 

  • Yi Q, Li C, Tang Y, Wang Q (2012) A new operational framework to job shop scheduling for reducing carbon emissions. In: 2012 IEEE international conference on automation science and engineering (CASE), pp 58–63

  • Zhang C, Gu P, Jiang P (2015) Low-carbon scheduling and estimating for a flexible job shop based on carbon footprint and carbon efficiency of multi-job processing. Proc Inst Mech Eng Part B J Eng Manuf 229(2):328–342

    Google Scholar 

  • Zhou S, Li X, Du N, Pang Y, Chen H (2018a) A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost. Comput Oper Res 96:55–68

    MathSciNet  MATH  Google Scholar 

  • Zhou S, Xie J, Du N, Pang Y (2018b) A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes. Appl Math Comput 334:254–268

    MathSciNet  MATH  Google Scholar 

  • Zhou S, Xing L, Zheng X, Du N, Wang L, Zhang Q (2019) A self-adaptive differential evolution algorithm for scheduling a single batch-processing machine with arbitrary job sizes and release times. IEEE Trans Cybern 51(3):1430–1442

    Google Scholar 

Download references

Funding

Not applicable.

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran

    Ali Fallahi & Seyed Taghi Akhavan Niaki

  2. School of Industrial Engineering, Islamic Azad University, South Tehran Branch, Tehran, Iran

    Bahareh Shahidi-Zadeh

Authors
  1. Ali Fallahi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bahareh Shahidi-Zadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Seyed Taghi Akhavan Niaki
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

All authors conceived of the presented idea. AF and BSZ developed the theory. AF performed the computations and wrote the initial draft. STAN verified the analytical methods, reviewed the draft, and was the supervisor. All authors discussed the results and contributed to the final manuscript.

Corresponding author

Correspondence to Ali Fallahi.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical approval

This study has not been duplicated publication or submitted elsewhere. The Local Ethics Committee approval was obtained.

Consent to participate

Not applicable.

Consent to publish

Not applicable.

Additional information

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Fallahi, A., Shahidi-Zadeh, B. & Niaki, S.T.A. Unrelated parallel batch processing machine scheduling for production systems under carbon reduction policies: NSGA-II and MOGWO metaheuristics. Soft Comput 27, 17063–17091 (2023). https://doi.org/10.1007/s00500-023-08754-0

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-023-08754-0

Keywords

Search

Navigation