Have a personal or library account? Click to login

Online and Semi–Online Scheduling on Two Hierarchical Machines with a Common Due Date to Maximize the Total Early Work

Open Access
|Jun 2024

Authors

Man Xiao

man1205@163.com

School of Mathematics and Statistics, Yunnan University, Kunming, China

Xiaoqiao Liu

1161407532@qq.com

School of Mathematics and Statistics, Yunnan University, Kunming, China

Weidong Li

weidongmath@126.com

School of Mathematics and Statistics, Yunnan University, Kunming, China

Xin Chen

chenxin.lut@hotmail.com

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

Malgorzata Sterna

malgorzata.sterna@cs.put.poznan.pl

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

Jacek Blazewicz

jblazewicz@cs.put.poznan.pl

Institute of Computing Science, Poznan University of Technology, Poznań, Poland
European Centre for Bioinformatics and Genomics, Polish Academy of Sciences, Poznań, Poland
DOI: https://doi.org/10.61822/amcs-2024-0018 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Language: English
Page range: 253 - 261
Submitted on: Oct 20, 2023
Accepted on: Feb 2, 2024
Published on: Jun 25, 2024
Published by: Sciendo
In partnership with: Paradigm Publishing Services
Publication frequency: 4 times per year

© 2024 Man Xiao, Xiaoqiao Liu, Weidong Li, Xin Chen, Malgorzata Sterna, Jacek Blazewicz, published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.