Have a personal or library account? Click to login
Two Meta–Heuristic Algorithms for Scheduling on Unrelated Machines with the Late Work Criterion Cover

Two Meta–Heuristic Algorithms for Scheduling on Unrelated Machines with the Late Work Criterion

International Journal of Applied Mathematics and Computer Science
Volume 30 (2020): Issue 3 (September 2020)
By: Wen Wang,  Xin Chen,  Jedrzej Musial and  Jacek Blazewicz  
Open Access
|Sep 2020

Authors

Wen Wang

School of Electronics and Information Engineering, Liaoning University of Technology, Jinzhou, China
Institute of Computing Science, Poznań University of Technology, Poznań, Poland

Xin Chen

chenxin.lut@hotmail.com

School of Electronics and Information Engineering, Liaoning University of Technology, Jinzhou, China

Jedrzej Musial

Institute of Computing Science, Poznań University of Technology, Poznań, Poland

Jacek Blazewicz

Institute of Computing Science, Poznań University of Technology, Poznań, Poland
Institute of Bioorganic Chemistry, Polish Academy of Sciences, Poznań, Poland
DOI: https://doi.org/10.34768/amcs-2020-0042 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Journal RSS Feed
Language: English
Page range: 573 - 584
Submitted on: Feb 20, 2020
Accepted on: Jul 2, 2020
Published on: Sep 29, 2020
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
late work minimization,
unrelated machines,
tabu search,
genetic algorithm
Related subjects:
Mathematics,
Applied mathematics

© 2020 Wen Wang, Xin Chen, Jedrzej Musial, Jacek Blazewicz, published by University of Zielona Góra
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Previous articleVolume 30 (2020): Issue 3 (September 2020)Next article