Login
Register
Reset Password
Publish & Distribute
Publishing Solutions
Distribution Solutions
Subjects
Publications
Journals
Books
Proceedings
Publishers
Blog
Contact
Search
Cart
EUR
USD
GBP
English
English
Deutsch
Polski
Español
Français
Italiano
Home
Journals
International Journal of Applied Mathematics and Computer Science
Volume 26 (2016): Issue 3 (September 2016)
Open Access
Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource
Rafał Różycki
Rafał Różycki
,
Grzegorz Waligóra
Grzegorz Waligóra
and
Jan Węglarz
Jan Węglarz
| Sep 29, 2016
International Journal of Applied Mathematics and Computer Science
Volume 26 (2016): Issue 3 (September 2016)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Published Online:
Sep 29, 2016
Page range:
693 - 706
Received:
Sep 07, 2015
Accepted:
May 18, 2016
DOI:
https://doi.org/10.1515/amcs-2016-0048
Keywords
machine scheduling
,
preemptable jobs
,
continuous resource
,
makespan
,
mathematical programming
© 2016 Rafał Różycki et al., published by De Gruyter Open
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
Rafał Różycki
Institute of Computing Science, Poznań University of Technology, Piotrowo 2, 60-965 Poznań, Poland
Grzegorz Waligóra
Institute of Computing Science, Poznań University of Technology, Piotrowo 2, 60-965 Poznań, Poland
Jan Węglarz
Institute of Computing Science, Poznań University of Technology, Piotrowo 2, 60-965 Poznań, Poland