Have a personal or library account? Click to login
Exact Approaches to Late Work Scheduling on Unrelated Machines Cover

Exact Approaches to Late Work Scheduling on Unrelated Machines

International Journal of Applied Mathematics and Computer Science
Volume 33 (2023): Issue 2 (June 2023)
By: Xinbo Liu,  Wen Wang,  Xin Chen,  Malgorzata Sterna and  Jacek Blazewicz  
Open Access
|Jun 2023

Authors

Xinbo Liu

lxb715@hotmail.com

SolBridge International School of Business, Woosong University, Republic of Korea

Wen Wang

wangwen.lut@outlook.com

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

Xin Chen

chenxin.lut@hotmail.com

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

Malgorzata Sterna

malgorzata.sterna@cs.put.poznan.pl

Institute of Computing Science, Poznan University of Technology, Poznan, Poland

Jacek Blazewicz

jblazewicz@cs.put.poznan.pl

Institute of Computing Science, Poznan University of Technology, Poznan, Poland
European Centre for Bioinformatics and Genomics Polish Academy of Sciences ul, Poznan, Poland
DOI: https://doi.org/10.34768/amcs-2023-0021 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Journal RSS Feed
Language: English
Page range: 285 - 295
Submitted on: Jun 10, 2022
Accepted on: Jan 12, 2023
Published on: Jun 23, 2023
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
late work scheduling,
unrelated machines,
mathematical model,
branch-and-bound algorithm,
dynamic programming
Related subjects:
Mathematics,
Applied mathematics

© 2023 Xinbo Liu, Wen Wang, Xin Chen, Malgorzata Sterna, Jacek Blazewicz, published by University of Zielona Góra
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Previous articleVolume 33 (2023): Issue 2 (June 2023)Next article