Minimum loss scheduling problems

Minimum loss scheduling problems

0.00 Avg rating0 Votes
Article ID: iaor19941740
Country: Netherlands
Volume: 56
Issue: 3
Start Page Number: 364
End Page Number: 369
Publication Date: Feb 1992
Journal: European Journal of Operational Research
Authors:
Keywords: graphs
Abstract:

The paper considers 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 the paper gives an algorithm that minimizes the total number (c.q. weight) of lost jobs.

Reviews

Required fields are marked *. Your email address will not be published.