Bag-of-Tasks Scheduling with Rejection in Large Computing Systems

Weidong Li ()
Additional contact information
Weidong Li: School of Mathematics and Statistics, Yunnan University, Kunming 650504, P. R. China

Asia-Pacific Journal of Operational Research (APJOR), 2023, vol. 40, issue 04, 1-13

Abstract: We are given a set of m identical parallel machines and a set of n jobs in large computing systems, where each job Jj consists of a bag of bj identical tasks with a processing time pj, and has a rejection penalty wj. Job Jj is either accepted in which case all the bj tasks must be processed by one of the machines, or rejected which incurs a rejection penalty wj. The problem of bag-of-tasks scheduling with rejection is to find a feasible schedule, so as to minimize the makespan plus the total rejection penalty of all rejected jobs. In this paper, we present a polynomial time approximation scheme.

Keywords: Bag-of-tasks scheduling; approximation algorithm; rejection penalty; polynomial time approximation scheme (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595923400110
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:40:y:2023:i:04:n:s0217595923400110

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595923400110

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().