Have a personal or library account? Click to login

Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource

International Journal of Applied Mathematics and Computer Science
Volume 26 (2016): Issue 3 (September 2016)
By:
Open Access
|Sep 2016

Authors

DOI: https://doi.org/10.1515/amcs-2016-0048 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Journal RSS Feed
Language: English
Page range: 693 - 706
Submitted on: Sep 7, 2015
Accepted on: May 18, 2016
Published on: Sep 29, 2016
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
machine scheduling,
preemptable jobs,
continuous resource,
makespan,
mathematical programming
Related subjects:
Mathematics,
Applied mathematics

© 2016 Rafał Różycki, Grzegorz Waligóra, Jan Węglarz, published by University of Zielona Góra
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Previous articleVolume 26 (2016): Issue 3 (September 2016)Next article