Single Machine Vector Scheduling with General Penalties
In this paper, we study the single machine vector scheduling problem (SMVS) with general penalties, in which each job is characterized by a <i>d</i>-dimensional vector and can be accepted and processed on the machine or rejected. The objective is to minimize the sum of the maximum load o...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-08-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/9/16/1965 |