Skip to main content

Advertisement

SpringerLink
Log in

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

  • Research Paper
  • Published:
Evolutionary Intelligence Aims and scope Submit manuscript

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.

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

Similar content being viewed by others

References

  1. 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

    Article  MATH  Google Scholar 

  2. 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

    Article  MathSciNet  MATH  Google Scholar 

  3. 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

    Google Scholar 

  4. 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

    Article  Google Scholar 

  5. 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

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  8. 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

    Article  Google Scholar 

  9. 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

    Article  Google Scholar 

  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

    Article  Google Scholar 

  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

    Article  MathSciNet  MATH  Google Scholar 

  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

    Article  Google Scholar 

  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

    Article  MathSciNet  MATH  Google Scholar 

  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

    Article  Google Scholar 

  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–340

    Article  Google Scholar 

  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

    Article  Google Scholar 

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

Download references

Author information

Authors and Affiliations

  1. Industrial Engineering Department, Nuh Naci Yazgan University, 38170, Kayseri, Turkey

    Oğuzhan Ahmet Arık

Authors
  1. Oğuzhan Ahmet Arık
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Oğuzhan Ahmet Arık.

Ethics declarations

Conflict of interest

The author declared that there is no conflict of interest.

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

Arık, O.A. Comparisons of metaheuristic algorithms for unrelated parallel machine weighted earliness/tardiness scheduling problems. Evol. Intel. 13, 415–425 (2020). https://doi.org/10.1007/s12065-019-00305-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12065-019-00305-7

Keywords

Search

Navigation