Abstract
| Original language | Undefined |
|---|---|
| Pages (from-to) | 364-369 |
| Number of pages | 6 |
| Journal | European journal of operational research |
| Volume | 56 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1992 |
Keywords
- IR-30031
- METIS-140670
Cite this
}
Minimum loss scheduling problems. / Nawijn, W.M.
In: European journal of operational research, Vol. 56, No. 3, 1992, p. 364-369.Research output: Contribution to journal › Article › Academic › peer-review
TY - JOUR
T1 - Minimum loss scheduling problems
AU - Nawijn, W.M.
PY - 1992
Y1 - 1992
N2 - We consider two minimum loss scheduling problems. Let the arrival epochs and processing times of n consecutive jobs be known. The first problem deals with the case these jobs can be processed by m parallel nonidentical machines without waiting room, i.e., a pure loss system. In the second problem there is one machine with a finite waiting room, i.e., a single machine delay-loss system. For both problems we give an algorithm that minimizes the total number (c.q. weight) of lost jobs.
AB - We consider two minimum loss scheduling problems. Let the arrival epochs and processing times of n consecutive jobs be known. The first problem deals with the case these jobs can be processed by m parallel nonidentical machines without waiting room, i.e., a pure loss system. In the second problem there is one machine with a finite waiting room, i.e., a single machine delay-loss system. For both problems we give an algorithm that minimizes the total number (c.q. weight) of lost jobs.
KW - IR-30031
KW - METIS-140670
U2 - 10.1016/0377-2217(92)90319-5
DO - 10.1016/0377-2217(92)90319-5
M3 - Article
VL - 56
SP - 364
EP - 369
JO - European journal of operational research
JF - European journal of operational research
SN - 0377-2217
IS - 3
ER -