JOURNAL ARTICLE

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

  • Published In: Asia-Pacific Journal of Operational Research, 2023, v. 40, n. 4. P. 1 1 of 3

  • Database: Business Source Ultimate 2 of 3

  • Authored By: Li, Weidong 3 of 3

Abstract

We are given a set of m identical parallel machines and a set of n jobs in large computing systems, where each job J j consists of a bag of b j identical tasks with a processing time p j , and has a rejection penalty w j . Job J j is either accepted in which case all the b j tasks must be processed by one of the machines, or rejected which incurs a rejection penalty w j . 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. [ABSTRACT FROM AUTHOR]

Additional Information

  • Source:Asia-Pacific Journal of Operational Research. 2023/08, Vol. 40, Issue 4, p1
  • Document Type:Article
  • Subject Area:Science
  • Publication Date:2023
  • ISSN:0217-5959
  • DOI:10.1142/S0217595923400110
  • Accession Number:171107358
  • Copyright Statement:Copyright of Asia-Pacific Journal of Operational Research is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Looking to go deeper into this topic? Look for more articles on EBSCOhost.