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
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

scientific article

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

zbMath1254.90071MaRDI QIDQ2906746

Shi Ling, Xueguang Cheng

Publication date: 5 September 2012


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

zbMATH Keywords

complexitysingle serverflow-shoptwo-machine\(NP\)-hardness


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)


Related Items (2)

Scheduling jobs with equal processing times and a single server on parallel identical machines ⋮ Two-machine open shop problem with a single server and set-up time considerations







This page was built for publication:

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