Minimum loss scheduling problems

W.M. Nawijn

Research output: Contribution to journalArticleAcademicpeer-review

9 Citations (Scopus)
24 Downloads (Pure)

Abstract

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.
Original languageUndefined
Pages (from-to)364-369
Number of pages6
JournalEuropean journal of operational research
Volume56
Issue number3
DOIs
Publication statusPublished - 1992

Keywords

  • IR-30031
  • METIS-140670

Cite this

Nawijn, W.M. / Minimum loss scheduling problems. In: European journal of operational research. 1992 ; Vol. 56, No. 3. pp. 364-369.
@article{10061143de9b42c58739a46db2d1d7c3,
title = "Minimum loss scheduling problems",
abstract = "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.",
keywords = "IR-30031, METIS-140670",
author = "W.M. Nawijn",
year = "1992",
doi = "10.1016/0377-2217(92)90319-5",
language = "Undefined",
volume = "56",
pages = "364--369",
journal = "European journal of operational research",
issn = "0377-2217",
publisher = "Elsevier",
number = "3",

}

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