Open AccessApproximation Solutions For Multicriteria Scheduling Problems
Author(s) -
Adawiyah A. Mahmood Al-Nuaimy
Publication year - 2021
Publication title -
magallaẗ kulliyyaẗ al-rāfidayn al-ǧāmi'aẗ al-'ulūm/maǧallaẗ kulliyyaẗ al-rāfidayn al-ǧāmiʻaẗ li-l-ʻulūm
Language(s) - English
Resource type - Journals
eISSN - 2790-2293
pISSN - 1681-6870
DOI - 10.55562/jrucs.v34i2.288
Subject(s) - tardiness , simulated annealing , mathematical optimization , single machine scheduling , computer science , local search (optimization) , scheduling (production processes) , job shop scheduling , genetic algorithm , schedule , tabu search , algorithm , mathematics , operating system
This paper presents local search algorithms for finding approximation solutions of the multicriteria scheduling problems within the single machine context, where the first problem is the sum of maximum tardiness and maximum late work and the second problem is the sum of total late work and maximum late work. Late work criterion estimates the quality of a schedule based on durations of late parts of jobs. Local search algorithms (descent method (DM), simulated annealing (SA) and genetic algorithm (GA))are implemented. Based on results of computational experiments, conclusions are formulated on the efficiency of the local search algorithms.