Vector scheduling with rejection on a single machine
Weidong Li () and
Additional contact information
Weidong Li: Yunnan University
Qianna Cui: Dianchi College of Yunnan University
4OR, 2018, vol. 16, issue 1, 95-104
Abstract In this paper, we study a vector scheduling problem with rejection on a single machine, in which each job is characterized by a d-dimension vector and a penalty, in the sense that, jobs can be either rejected by paying a certain penalty or assigned to the machine. The objective is to minimize the sum of the maximum load over all dimensions of the total vector of all accepted jobs, and the total penalty of rejected jobs. We prove that the problem is NP-hard and design two approximation algorithms running in polynomial time. When d is a fixed constant, we present a fully polynomial time approximation scheme.
Keywords: Vector scheduling; Approximation algorithms; Dynamic programming; Fully polynomial time approximation scheme; 90B35 (search for similar items in EconPapers)
References: Add references at CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
http://link.springer.com/10.1007/s10288-017-0356-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:spr:aqjoor:v:16:y:2018:i:1:d:10.1007_s10288-017-0356-0
Ordering information: This journal article can be ordered from
https://www.springer ... ch/journal/10288/PSE
Access Statistics for this article
4OR is currently edited by Yves Crama, Michel Grabisch and Silvano Martello
More articles in 4OR from Springer
Bibliographic data for series maintained by Sonal Shukla ().