Online Batch Scheduling of Simple Linear Deteriorating Jobs with Incompatible Families
We considered the online scheduling problem of simple linear deteriorating job families on <i>m</i> parallel batch machines to minimize the makespan, where the batch capacity is unbounded. In this paper, simple linear deteriorating jobs mean that the actual processing time <inline-for...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-02-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/8/2/170 |