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

Job release scheduling problem: complexity and an approximation algorithm

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

DOI10.1016/J.DAM.2012.10.011zbMath1267.90047OpenAlexW2083955370MaRDI QIDQ1946231

Byung-Cheon Choi, Ji-Bok Chung

Publication date: 18 April 2013

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.10.011


zbMATH Keywords

variabilitycomputational complexityschedulingapproximation algorithm


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)








This page was built for publication: Job release scheduling problem: complexity and an approximation algorithm

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