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

scientific article

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

zbMath1277.90053MaRDI QIDQ2865876

Gilles Simonin, Benoit Darties, Rodolphe Giroudeau, Jean-Claude Konig

Publication date: 11 December 2013

Full work available at URL: http://journals.hil.unb.ca/index.php/AOR/article/view/18602

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexityschedulingapproximation algorithmcoupled-tasks


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)


Related Items (2)

Some complexity and approximation results for coupled-tasks scheduling problem according to topology ⋮ Parameterized complexity of a coupled-task scheduling problem




This page was built for publication:

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