Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A simple optimal algorithm for scheduling variable-sized requests

From MaRDI portal
Publication:293470
Jump to:navigation, search

DOI10.1016/S0020-0190(98)00177-XzbMath1339.90137OpenAlexW2058348987MaRDI QIDQ293470

Janelle J. Harms

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S002001909800177X?np=y


zbMATH Keywords

schedulingoptimalitycommunication networksadvance reservation


Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35)


Related Items (1)

Fixed interval scheduling: models, applications, computational complexity and algorithms




Cites Work

  • Scheduling jobs with fixed start and end times




This page was built for publication: A simple optimal algorithm for scheduling variable-sized requests

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:293470&oldid=12174938"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 02:09.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki