The resource constraint job scheduling problem considered in this work is a difficult optimization problem that was defined in the context of the transportation of minerals from mines to ports. The main characteristics are that all jobs share a common limiting resource and that the objective function concerns the minimization of the total weighted tardiness of all jobs. The algorithms proposed in the literature for this problem have a common disadvantage: they require a huge amount of computation time. Therefore, the main goal of this work is the development of an algorithm that can compete with the state of the art, while using much less computational resources. In fact, our experimental results show that the biased random key genetic algorithm that we propose significantly outperforms the state-of-the-art algorithm from the literature both in terms of solution quality and computation time.
History
Volume
11919
Pagination
549-560
Location
Adelaide, S. Aust.
Start date
2019-12-02
End date
2019-12-05
ISSN
0302-9743
eISSN
1611-3349
ISBN-13
9783030352875
Language
eng
Publication classification
E1 Full written paper - refereed
Editor/Contributor(s)
Liu J, Bailey J
Title of proceedings
AI 2019: Advances in artificial intelligence : Proceedings of the 32nd Australasian Joint Conference on Artificial Intelligence 2019
Event
Artificial Intelligence. Conference (32nd : 2019 : Adelaide, S. Aust.)