Abstract

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.

Keywords

The article was added to IASJ on 2014-09-30

241 Total full text downloads since the date of addition