Efficiency of Metaheuristics in PMJS_E/T Scheduling Problem

Authors:
Marcin Bazyluk;Leszek Koszalka
Affiliations:
Chair of Computer Systems and Networks, Wroclaw University of Technology, Wroclaw, Poland 50-370;Chair of Computer Systems and Networks, Wroclaw University of Technology, Wroclaw, Poland 50-370
Venue:
KES-AMSTA '09 Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
Year:
2009

Citing 7
Cited 0

One-processor scheduling with symmetric earliness and tardiness penalties

Mathematics of Operations Research
Parallel machine scheduling with earliness and tardiness penalties

Computers and Operations Research
Multi Colony Ant Algorithms

Journal of Heuristics
The Ant System Applied to the Quadratic Assignment Problem

IEEE Transactions on Knowledge and Data Engineering
Parallel machine earliness and tardiness scheduling with proportional weights

Computers and Operations Research
Parallel machine selection and job scheduling to minimize machine cost and job tardiness

Computers and Operations Research
An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Influence of the instance size on the efficiency of metaheuristic algorithms for the parallel machine job scheduling with earliness and tardiness penalties problem (PMJS_E/T) has been considered since their emergence. Such size is understood as the number of jobs which need to be scheduled and the number of available machines, capable of their execution. Investigations show that the proper selection of a metaheuristic for a given instance becomes an important issue leading to noticeable improve of quality. This paper tries to determine that dependence and suggests some policy on the selection.