Two-Client Scheduling with Order Selection
Journal of Big Data and Computing · 2026-06 · 4 (2) · 177-181
DOI: 10.62517/jbdc.202601224 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Big Data and Computing, 2026-06. Verfasst von Qi Feng und 1 weiteren Autor:innen. Die Arbeit nennt 10 Literaturangaben.
Abstract (Originalsprache)
The paper addresses two-client scheduling with order selection on a machine. There are two clients G and H. Each having his own item sets. An item of each client needs to be selected before processing. Namely, an item is either selected to accept and process on the machine, or reject but require to pay a certain penalty for rejection. Decision makers want to minimize the sum of objections of accepted items and the rejection penalty of rejected items of client G. But at the same time, the sum of objections of accepted items and the rejection penalty of rejected items of client H can not exceed a constant. For the above problems, we first uncover crucial structural properties. Then analysis several different cases when items are processed on the machine. And develop two algorithms at last.
Zitieren
APA
Feng, Q., & Su, L. (2026). Two-Client Scheduling with Order Selection. Journal of Big Data and Computing, 4(2), 177-181. https://doi.org/10.62517/jbdc.202601224
Vancouver
Feng Q, Su L. Two-Client Scheduling with Order Selection. Journal of Big Data and Computing. 2026;4(2):177-181. doi:10.62517/jbdc.202601224
BibTeX
@article{Feng2026,
author = {Feng, Qi and Su, Liangliang},
title = {Two-Client Scheduling with Order Selection},
journal = {Journal of Big Data and Computing},
year = {2026},
volume = {4},
number = {2},
pages = {177--181},
doi = {10.62517/jbdc.202601224}
}
EUVIMED