Scheduling jobs with release times on a machine with finite storage

Share/Save/Bookmark

Nawijn, W.M. and Kern, W. and Baas, S. (1994) Scheduling jobs with release times on a machine with finite storage. European Journal of Operational Research, 78 (1). pp. 120-127. ISSN 0377-2217

open access
[img]
Preview
PDF
523kB
Abstract:Consider a single machine with a buffer which can store up to b waiting jobs for some fixed b. Given the release times, the weights and the processing times of n consecutive jobs, a maximum weight subset of jobs is to be found that is schedulable without violating the buffer's capacity constraint. A polynomial algorithm for the unweighted loss-delay problem is presented. The weighted case is shown to be NP-hard as well as an unweighted two-machine version.
Item Type:Article
Copyright:© 1994 Elsevier Science
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/30038
Official URL:http://dx.doi.org/10.1016/0377-2217(94)90209-7
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 140677