W-prize-collecting scheduling problem on parallel machines

Bo Hou (), Tianjiao Guo (), Suogang Gao (), Guanghua Wang (), Weili Wu () and Wen Liu ()
Additional contact information
Bo Hou: Hebei Normal University
Tianjiao Guo: Hebei Normal University
Suogang Gao: Hebei Normal University
Guanghua Wang: University of Texas at Dallas
Weili Wu: University of Texas at Dallas
Wen Liu: Hebei Normal University

Journal of Combinatorial Optimization, 2024, vol. 48, issue 3, No 11, 9 pages

Abstract: Abstract In this paper, we consider the W-prize-collecting scheduling problem on parallel machines. In this problem, we are given a set of n jobs, a set of m identical parallel machines and a value W. Each job $$J_j$$ J j has a processing time, a profit and a rejection penalty. Each job is either accepted and processed on one of the machines without preemption, or rejected and paid a rejection penalty. The objective is to minimize the sum of the makespan of accepted jobs and the penalties of rejected jobs, and at the same time the total profit brought by accepted jobs is not less than W. We design a 2-approximation algorithm for the problem based on the greedy method and the list scheduling algorithm.

Keywords: Scheduling problem with rejection; Approximation algorithm; List scheduling algorithm; Greedy method (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-024-01212-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jcomop:v:48:y:2024:i:3:d:10.1007_s10878-024-01212-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-024-01212-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().