nach oben

The International Journal of Advanced Manufacturing Technology

Erschienen in:

10.05.2021 | ORIGINAL ARTICLE

A memetic algorithm to solve uncertain energy-efficient flow shop scheduling problems

verfasst von: Mariappan Kadarkarainadar Marichelvam, Mariappan Geetha

Erschienen in: The International Journal of Advanced Manufacturing Technology | Ausgabe 1-2/2021

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

This paper addresses energy-efficient flow shop scheduling problems with uncertainties such as cancelled and new orders to minimize the total energy cost (TEC). The absenteeism of workers is also considered. As this problem is NP-hard (non-deterministic polynomial-time hard) in nature, an improved memetic algorithm (IMA) is proposed to tackle this problem. A constructive heuristic is built-in with the memetic algorithm (MA) for the improvement of the solution quality. Additionally, likelihood-based selection, crossover, and mutation operators are utilized in the IMA. A variable neighborhood search (VNS) algorithm is also hybridized as a local exploration heuristics. Broad computational experimentations are presented. The results of IMA are compared with a set of algorithms addressed in the literature. It is shown that the IMA overtakes other algorithms in terms of solution quality.

Vorheriger Artikel Multi-objective optimization of carbon fiber–reinforced polymer drilling process based on grey fuzzy reasoning grade analysis

Nächster Artikel Vacuum laser beam welding characteristics for aluminum alloys and its effects on plasma plume generation and laser weldability

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Liu M, Yang X, Chu F, Zhang J, Chu C (2020) Energy-oriented bi-objective optimization for the tempered glass scheduling. Omega 90:101995. https://doi.org/10.1016/j.omega.2018.11.004CrossRef

Johnson SM (1954) Optimal two-and three-stage production schedules with setup times included. Naval Res Logist Quart 1(1):61–68MATHCrossRef

Marichelvam MK (2012) An improved hybrid Cuckoo Search (IHCS) metaheuristics algorithm for permutation flowshop scheduling problems. Int J Bio-Inspir Comput 4(4):200–205CrossRef

Mansouri SA, Aktas E (2016) Minimizing energy consumption and makespan in a two-machine flowshop scheduling problem. J Oper Res Soc 67(11):1382–1394CrossRef

Chiu Y, Shih CJ (2012) Rescheduling strategies for integrating rush orders with preventive maintenance in a two-machine flowshop. Int J Prod Res 50(20):5783–5794CrossRef

Lu C, Gao L, Li X, Pan Q, Wang Q (2017) Energy-efficient permutation flowshop scheduling problem using a hybrid multi-objective backtracking search algorithm. J Clean Prod 144:228–238CrossRef

May G, Stahl B, Taisch M, Kiritsis D (2017) Energy management in manufacturing: from literature review to a conceptual framework. J Clean Prod 167:1464–1489CrossRef

Liu GS, Zhou Y, Yang HD (2017b) Minimizing energy consumption and tardiness penalty for fuzzy flowshop scheduling with state-dependent setup time. J Clean Prod 147:470–484CrossRef

Li X, Lu C, Gao L, Xiao S, Wen L (2018) An effective multiobjective algorithm for energy-efficient scheduling in a real-life welding shop. IEEE Transac Industr Inform 14(12):5400–5409CrossRef

10.

Wang F, Deng G, Jiang T, Zhang S (2018) Multi-objective parallel variable neighborhood search for energy consumption scheduling in blocking flowshops. IEEE Access 6:68686–68700CrossRef

11.

Chen JF, Wang L, Peng ZP (2019) A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle flow-shop scheduling. Swarm Evol Comput 50:100557. https://doi.org/10.1016/j.swevo.2019.100557CrossRef

12.

Fu Y, Tian G, Fathollahi-Fard AM, Ahmadi A, Zhang C (2019) Stochastic multi-objective modelling and optimization of an energy-conscious distributed permutation flowshop scheduling problem with the total tardiness constraint. J Clean Prod 226:515–525CrossRef

13.

Gao K, Huang Y, Sadollah A, Wang L (2019) A review of energy-efficient scheduling in intelligent production systems. Complex Intellig Syst 6:1–13. https://doi.org/10.1007/s40747-019-00122-6CrossRef

14.

Kizilay D, Tasgetiren MF, Pan QK, Süer G (2019) An ensemble of meta-heuristics for the energy-efficient blocking flowshop scheduling problem. Proced Manuf 39:1177–1184CrossRef

15.

Ramezanian R, Vali-Siar MM, Jalalian M (2019) Green permutation flowshop scheduling problem with sequence-dependent setup times: a case study. Int J Prod Res 57(10):3311–3333CrossRef

16.

Tasgetiren MF, Öztop H, Gao L, Pan QK, Li X (2019) A variable iterated local search algorithm for energy-efficient no-idle flowshop scheduling problem. Proced Manuf 39:1185–1193CrossRef

17.

Wu X, Che A (2019) Energy-efficient no-wait permutation flow shop scheduling by adaptive multi-objective variable neighborhood search. Omega 94:102117. https://doi.org/10.1016/j.omega.2019.102117CrossRef

18.

Amiri MF, Behnamian J (2020) Multi-objective green flowshop scheduling problem under uncertainty: estimation of distribution algorithm. J Clean Prod 251:119734. https://doi.org/10.1016/j.jclepro.2019.119734CrossRef

19.

Öztop H, Tasgetiren MF, Eliiyi DT, Pan QK, Kandiller L (2020) An energy-efficient permutation flowshop scheduling problem. Expert Syst Appl 150:113279. https://doi.org/10.1016/j.eswa.2020.113279CrossRef

20.

Yüksel D, Taşgetiren MF, Kandiller L, Gao L (2020) An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption. Comput Ind Eng 145:106431. https://doi.org/10.1016/j.cie.2020.106431CrossRef

21.

Wang W, Tian G, Chen M, Tao F, Zhang C, Abdulraham AA, Li Z, Jiang Z (2020) Dual-objective program and improved artificial bee colony for the optimization of energy-conscious milling parameters subject to multiple constraints. J Clean Prod 245:118714. https://doi.org/10.1016/j.jclepro.2019.118714CrossRef

22.

Gu XS (2000) A survey of production scheduling under uncertainty. J East China Univ Sci Technol 26(5):441–446

23.

Yan-hai H, Jun-qi Y, Fei-fan Y, Jun-he Y (2005) Flow shop rescheduling problem under rush orders. J Zhejiang Univ-Sci A 6(10):1040–1046CrossRef

24.

Katragjini K, Vallada E, Ruiz R (2013) Flow shop rescheduling under different types of disruption. Int J Prod Res 51(3):780–797CrossRef

25.

Li JQ, Pan QK, Mao K (2015) A discrete teaching-learning-based optimisation algorithm for realistic flowshop rescheduling problems. Eng Appl Artif Intell 37:279–292CrossRef

26.

Rahman HF, Sarker R, Essam D (2015) A genetic algorithm for permutation flow shop scheduling under make to stock production system. Comput Ind Eng 90:12–24CrossRef

27.

González-Neira E, Montoya-Torres J, Barrera D (2017) Flow-shop scheduling problem under uncertainties: review and trends. Int J Ind Eng Comput 8(4):399–426

28.

Tian G, Zhou M, Li P (2017) Disassembly sequence planning considering fuzzy component quality and varying operational cost. IEEE Trans Autom Sci Eng 15(2):748–760CrossRef

29.

Liu W, Jin Y, Price M (2017) A new improved NEH heuristic for permutation flowshop scheduling problems. Int J Prod Econ 193:21–30CrossRef

30.

Liu W, Jin Y, Price M (2018) New meta-heuristic for dynamic scheduling in permutation flowshop with new order arrival. Int J Adv Manuf Technol 98(5-8):1817–1830CrossRef

31.

Marichelvam MK, Geetha M (2019) A hybrid algorithm to solve the stochastic flow shop scheduling problems with machine break down. Int J Enterpr Network Manag 10(2):162–175CrossRef

32.

Wang Z, Zhang J, Yang S (2019) An improved particle swarm optimization algorithm for dynamic job shop scheduling problems with random job arrivals. Swarm Evol Comput 51:100594. https://doi.org/10.1016/j.swevo.2019.100594CrossRef

33.

Fu Y, Wang H, Tian G, Li Z, Hu H (2019) Two-agent stochastic flow shop deteriorating scheduling via a hybrid multi-objective evolutionary algorithm. J Intell Manuf 30(5):2257–2272CrossRef

34.

Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech concurrent computation program, C3P Report, 826

35.

França PM, Mendes A, Moscato P (2001) A memetic algorithm for the total tardiness single machine scheduling problem. Eur J Oper Res 132(1):224–242MathSciNetMATHCrossRef

36.

Liu B, Wang L, Jin YH (2007) An effective PSO-based memetic algorithm for flow shop scheduling. IEEE Transac Syst Man Cybernet Part B (Cybernetics) 37(1):18–27CrossRef

37.

Nawaz M, Enscore EE Jr, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1):91–95CrossRef

38.

Hasan SK, Sarker R, Essam D, Cornforth D (2009) Memetic algorithms for solving job-shop scheduling problems. Memetic Comput 1(1):69–83CrossRef

39.

Frutos M, Olivera AC, Tohmé F (2010) A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem. Ann Oper Res 181(1):745–765MathSciNetCrossRef

40.

Korosec P, Papa G, Vukasinovic V (2010) Production scheduling with a memetic algorithm. Int J Innov Comput Appl 2(4):244–252CrossRef

41.

Cheng HC, Chiang TC, Fu LC (2011) A two-stage hybrid memetic algorithm for multi objective job shop scheduling. Expert Syst Appl 38(9):10983–10998CrossRef

42.

Chiang TC, Cheng HC, Fu LC (2011) NNMA: an effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems. Expert Syst Appl 38(5):5986–5999CrossRef

43.

Gao L, Zhang G, Zhang L, Li X (2011) An efficient memetic algorithm for solving the job shop scheduling problem. Comput Ind Eng 60(4):699–705CrossRef

44.

Wang BG, Zhang, GH (2011) Hybrid VNS and memetic algorithm for solving the job shop scheduling problem. In Industrial Engineering and Engineering Management (IE&EM), IEEE 18Th International Conference on pp. 924–927, IEEE

45.

Neri F, Cotta C (2012) Memetic algorithms and memetic computing optimization: a literature review. Swarm Evol Comput 2:1–14CrossRef

46.

Mencía R, Sierra MR, Mencía C, Varela R (2015) Memetic algorithms for the job shop scheduling problem with operators. Appl Soft Comput 34:94–105MATHCrossRef

47.

Deng J, Wang L, Wang SY, Zheng XL (2016) A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem. Int J Prod Res 54(12):3561–3577CrossRef

48.

Liu B, Wang K, Zhang R (2016) Variable neighborhood based memetic algorithm for distributed assembly permutation flowshop. In Evolutionary Computation (CEC), 2016 IEEE Congress on pp. 1682–1686. IEEE

49.

Wang SY, Wang L (2016) An estimation of distribution algorithm-based memetic algorithm for the distributed assembly permutation flow-shop scheduling problem. IEEE Transac Syst Man Cybern 46(1):139–149CrossRef

50.

Yun X, Feng X, Lyu X, Wang S, Liu B (2016) A novel water wave optimization based memetic algorithm for flow-shop scheduling. In Evolutionary Computation (CEC), 2016 IEEE Congress on pp. 1971–1976. IEEE

51.

Deng J, Wang L (2017) A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem. Swarm Evol Comput 32:121–131CrossRef

52.

Shao W, Pi D, Shao Z (2017) Memetic algorithm with node and edge histogram for no-idle flow shop scheduling problem to minimize the makespan criterion. Appl Soft Comput 54:164–182CrossRef

53.

Kurdi M (2017) An improved island model memetic algorithm with a new cooperation phase for multi-objective job shop scheduling problem. Comput Ind Eng 111:183–201CrossRef

54.

Phu-ang A, Thammano A (2017) Memetic algorithm based on marriage in honey bees optimization for flexible job shop scheduling problem. Memetic Comput 9(4):295–309CrossRef

55.

Zuo Y, Gong M, Jiao L (2017) Adaptive multimeme algorithm for flexible job shop scheduling problem. Nat Comput 16(4):677–698MathSciNetCrossRef

56.

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

57.

Kurdi M (2020) A memetic algorithm with novel semi-constructive evolution operators for permutation flowshop scheduling problem. Appl Soft Comput 94:106458. https://doi.org/10.1016/j.asoc.2020.106458CrossRef

58.

Marichelvam MK, Tosun Ö, Geetha M (2017) Hybrid monkey search algorithm for flow shop scheduling problem under makespan and total flow time. Appl Soft Comput 55:82–92CrossRef

59.

Kalczynski PJ, Kamburowski J (2008) An improved NEH heuristic to minimize makespan in permutation flow shops. Comput Oper Res 35(9):3001–3008MathSciNetMATHCrossRef

60.

Umbarkar AJ, Sheth PD (2015) Crossover operators in genetic algorithms: a review. ICTACT J Soft Comput 6(1):1083–1092CrossRef

61.

Eiben AE (2001) Evolutionary algorithms and constraint satisfaction: definitions, survey, methodology, and research directions. In: Theoretical aspects of evolutionary computing. Springer, Berlin, pp 13–30MATHCrossRef

62.

Rajkumar R, Shahabudeen P (2009) An improved genetic algorithm for the flowshop scheduling problem. Int J Prod Res 47(1):233–249MATHCrossRef

63.

Mladenović N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097–1100MathSciNetMATHCrossRef

Titel: A memetic algorithm to solve uncertain energy-efficient flow shop scheduling problems
verfasst von: Mariappan Kadarkarainadar Marichelvam
Mariappan Geetha
Publikationsdatum: 10.05.2021
Verlag: Springer London
Erschienen in: The International Journal of Advanced Manufacturing Technology / Ausgabe 1-2/2021
Print ISSN: 0268-3768
Elektronische ISSN: 1433-3015
DOI: https://doi.org/10.1007/s00170-021-07228-7

Premium Partner

Marktübersichten

Die im Laufe eines Jahres in der „adhäsion“ veröffentlichten Marktübersichten helfen Anwendern verschiedenster Branchen, sich einen gezielten Überblick über Lieferantenangebote zu verschaffen.

Zur Marktübersicht

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Weitere Artikel der Ausgabe 1-2/2021

A brief review on welding of stainless steel clad plates: issues and future perspectives

A simplified formulation for predicting wrinkling of thin-wall elbow tube in granular media–based push-bending process

A review: use of evolutionary algorithm for optimisation of machining parameters

Surface texture and friction property of Ti-6Al-4V processed by rotary ultrasonic rolling

Multi-objective optimization of carbon fiber–reinforced polymer drilling process based on grey fuzzy reasoning grade analysis

Affecting factors, optimization, and suppression of grinding marks: a review

Premium Partner

Marktübersichten