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

Approximation algorithms for parallel machine scheduling with speed-up resources

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

DOI10.4230/LIPIcs.APPROX-RANDOM.2016.5zbMath1398.90047OpenAlexW2563842788MaRDI QIDQ4636435

Deshi Ye, Lin Chen, Guo-Chuan Zhang

Publication date: 19 April 2018

Full work available at URL: https://dblp.uni-trier.de/db/conf/approx/approx2016.html#0011YZ16


zbMATH Keywords

linear programmingschedulingapproximation algorithms


Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)








This page was built for publication: Approximation algorithms for parallel machine scheduling with speed-up resources

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