Top

Evolutionary Intelligence

Published in:

17-10-2019 | Research Paper

Comparisons of metaheuristic algorithms for unrelated parallel machine weighted earliness/tardiness scheduling problems

Author: Oğuzhan Ahmet Arık

Published in: Evolutionary Intelligence | Issue 3/2020

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

Abstract

This paper investigates unrelated parallel machine scheduling problems where the objectives are to minimize total weighted sum of earliness/tardiness costs. Three different metaheuristic algorithms are compared with others to determine what kind (swarm intelligence based, evolutionary or single solution) of metaheuristics is effective to solve these problems. In this study, artificial bee colony (ABC), genetic algorithm and simulated annealing algorithm are chosen as swarm intelligence based algorithm, evolutionary algorithm and single solution algorithm. All proposed algorithms are created without modification in order to determine effectiveness of these metaheuristics. Experimental results show that ABC outperforms its opponents in view of solution quality as swarm intelligence based metaheuristic algorithm.

previous article A novel method for high-level synthesis of datapaths in digital filters using a moth-flame optimization algorithm

next article A novel hybrid bat algorithm with a fast clustering-based hybridization

Dont have a licence yet? Then find out more about our products and how to get one now:

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!

inform now

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!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Adamopoulos GI, Pappis CP (1998) Scheduling under a common due-date on parallel unrelated machines. Eur J Oper Res 105:494–501. https://doi.org/10.1016/S0377-2217(97)00057-X CrossRefMATH

Bank J, Werner F (2001) Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties. Math Comput Model 33:363–383. https://doi.org/10.1016/S0895-7177(00)00250-8 MathSciNetCrossRefMATH

Yang Y-J, Liu M, Wu C (2001) Evolutionary strategy method for parallel machine earliness/tardiness scheduling problem with common due date. Tien Tzu Hsueh Pao/Acta Electron Sin 29:1478–1481

Xiao W-Q, Li C-L (2002) Approximation algorithms for common due date assignment and job scheduling on parallel machines. IIE Trans Inst Ind Eng 34:466–477. https://doi.org/10.1080/07408170208928883 CrossRef

Mönch L, Unbehaun R (2007) Decomposition heuristics for minimizing earliness–tardiness on parallel burn-in ovens with a common due date. Comput Oper Res 34:3380–3396. https://doi.org/10.1016/j.cor.2006.02.003 CrossRefMATH

Toksarı MD, Güner E (2008) Minimizing the earliness/tardiness costs on parallel machine with learning effects and deteriorating jobs: a mixed nonlinear integer programming approach. Int J Adv Manuf Technol 38:801–808. https://doi.org/10.1007/s00170-007-1128-3 CrossRef

Toksarı MD, Güner E (2009) Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration. Comput Oper Res 36:2394–2417. https://doi.org/10.1016/j.cor.2008.09.012 CrossRefMATH

Toksarı MD, Güner E (2010) The common due-date early/tardy scheduling problem on a parallel machine under the effects of time-dependent learning and linear and nonlinear deterioration. Expert Syst Appl 37:92–112. https://doi.org/10.1016/j.eswa.2009.05.014 CrossRef

Toksarı MD, Güner E (2010) Parallel machine scheduling problem to minimize the earliness/tardiness costs with learning effect and deteriorating jobs. J Intell Manuf 21:843–851. https://doi.org/10.1007/s10845-009-0260-3 CrossRef

10.

Srirangacharyulu B, Srinivasan G (2011) Minimising mean squared deviation of job completion times about a common due date in multimachine systems. Eur J Ind Eng 5:424–447. https://doi.org/10.1504/EJIE.2011.042740 CrossRef

11.

Drobouchevitch IG, Sidney JB (2012) Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs. Comput Oper Res 39:1919–1926. https://doi.org/10.1016/j.cor.2011.05.012 MathSciNetCrossRefMATH

12.

Kim J-G, Kim J-S, Lee D-H (2012) Fast and meta-heuristics for common due-date assignment and scheduling on parallel machines. Int J Prod Res 50:6040–6057. https://doi.org/10.1080/00207543.2011.644591 CrossRef

13.

Beyranvand MS, Peyghami MR, Ghatee M (2012) On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date. Optim Lett 6:1897–1911. https://doi.org/10.1007/s11590-011-0385-0 MathSciNetCrossRefMATH

14.

Awasthi A, Lässig J, Kramer O (2014) Common due-date problem: exact polynomial algorithms for a given job sequence. In: Proceedings - 15th international symposium on symbolic and numeric algorithms for scientific computing, SYNASC 2013, 2014, pp 258–264

15.

Lin S-W, Ying K-C, Chiang Y-I, Wu W-J (2016) Minimising total weighted earliness and tardiness penalties on identical parallel machines using a fast ruin-and-recreate algorithm. Int J Prod Res 54:6879–6890. https://doi.org/10.1080/00207543.2016.1190041 CrossRef

16.

Guha R, Ghosh M, Kapri S et al (2019) Deluge based genetic algorithm for feature selection. Evol Intell. Special Issue:1–11. https://doi.org/10.1007/s12065-019-00218-5

17.

Sharma S, Kumar S, Sharma K (2019) Improved Gbest artificial bee colony algorithm for the constraints optimization problems. Evol Intell. Special Issue:1–7. https://doi.org/10.1007/s12065-019-00231-8

18.

Yang Z, Wang L, Cai Y, Kimie K (2018) A polychromatic sets theory based algorithm for the input/output scheduling problem in AS/RSs. Evol Intell 12:333–340CrossRef

19.

Islam MR, Saifullah CMK, Mahmud MR (2019) Chemical reaction optimization: survey on variants. Evol Intell. 12:395–420. https://doi.org/10.1007/s12065-019-00246-1 CrossRef

20.

Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Technical Report TR06, Engineering Faculty, Computer Engineering Department, Erciyes University

Title: Comparisons of metaheuristic algorithms for unrelated parallel machine weighted earliness/tardiness scheduling problems
Author: Oğuzhan Ahmet Arık
Publication date: 17-10-2019
Publisher: Springer Berlin Heidelberg
Published in: Evolutionary Intelligence / Issue 3/2020
Print ISSN: 1864-5909
Electronic ISSN: 1864-5917
DOI: https://doi.org/10.1007/s12065-019-00305-7

Springer Professional

Abstract

Please log in to get access to your license.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Other articles of this Issue 3/2020

Metaheuristic anopheles search algorithm

Mutation probability-based lion algorithm for design and optimization of microstrip patch antenna

A parallel classification framework for protein fold recognition

Improving many objective optimisation algorithms using objective dimensionality reduction

Triclustering of gene expression microarray data using coarse grained and dynamic deme based parallel genetic approach

Solving the twitter sentiment analysis problem based on a machine learning-based approach

Premium Partner