Oct 16, 2017 · 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 ...

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 ...

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.

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 ...

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 ...

In this paper, we design an online algorithm for vector scheduling on a single machine with rejection and its competitive ratio is d, where d is the ...

It is proved that the vector scheduling problem with rejection on a single machine is NP-hard and two approximation algorithms running in polynomial time ...

Abstract—In this paper, we design an online algorithm for vector scheduling on a single machine with rejection and its competitive ratio is d, ...

In this paper, we study the single machine vector scheduling problem (SMVS) with general penalties, in which each job is characterized by a d-dimensional ...

Vector scheduling with rejection on a single machine ; Journal: 4OR, 2017, № 1, p. 95-104 ; Publisher: Springer Nature ; Authors: Weidong Li, Qianna Cui ; Funder ...