Minimum loss scheduling problems

Share/Save/Bookmark

Nawijn, W.M. (1992) Minimum loss scheduling problems. European Journal of Operational Research, 56 (3). pp. 364-369. ISSN 0377-2217

open access
[img]
Preview
PDF
361kB
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.
Item Type:Article
Copyright:© 1992 Elsevier Science
Link to this item:http://purl.utwente.nl/publications/30031
Official URL:http://dx.doi.org/10.1016/0377-2217(92)90319-5
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 140670