loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Marcin Bazyluk 1 ; Leszek Koszalka 1 and Keith J. Burnham 2

Affiliations: 1 Wroclaw University of Technology, Poland ; 2 Control Theory and Applications Centre, Coventry University, United Kingdom

ISBN: 978-989-8111-30-2

Keyword(s): Task scheduling, parallel machines, heuristics, genetic algorithms, tabu search.

Related Ontology Subjects/Areas/Topics: Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Optimization Algorithms

Abstract: This paper considers the problem of parallel machine scheduling with the earliness and tardiness penalties (PMSP E/T) in which a set of sequence-independent jobs is to be scheduled on a set of given machines to minimize a sum of the weighted earliness and tardiness values. The weights and due dates of the jobs are distinct positive numbers. The machines are diverse - each has a different execution speed of the respective jobs, thus the problem becomes more complex. To handle this, it two heuristics are employed, namely: the genetic algorithm with the MCUOX crossover operator and the tabu search. The performances of the both approaches are evaluated and their dependency on the shape of the investigated instances examined. The results indicate the significant predominance of the genetic approach for the larger-sized instances.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.210.22.132

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Bazyluk M.; Koszalka L.; J. Burnham K. and (2008). PARALLEL MACHINE EARLINESS-TARDINESS SCHEDULING - Comparison of Two Metaheuristic Approaches.In Proceedings of the Fifth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-989-8111-30-2, pages 80-85. DOI: 10.5220/0001476500800085

@conference{icinco08,
author={Marcin Bazyluk and Leszek Koszalka and Keith {J. Burnham}},
title={PARALLEL MACHINE EARLINESS-TARDINESS SCHEDULING - Comparison of Two Metaheuristic Approaches},
booktitle={Proceedings of the Fifth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2008},
pages={80-85},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001476500800085},
isbn={978-989-8111-30-2},
}

TY - CONF

JO - Proceedings of the Fifth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - PARALLEL MACHINE EARLINESS-TARDINESS SCHEDULING - Comparison of Two Metaheuristic Approaches
SN - 978-989-8111-30-2
AU - Bazyluk, M.
AU - Koszalka, L.
AU - J. Burnham, K.
PY - 2008
SP - 80
EP - 85
DO - 10.5220/0001476500800085

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.