Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 919276

From MaRDI portal
Jump to:navigation, search

zbMATH Open0860.90076MaRDI QIDQ4888940FDOQ4888940


Authors: A. G. Shchukin, N. I. Glebov Edit this on Wikidata


Publication date: 25 August 1996



Title of this publication is not available (Why is that?)



Recommendations

  • Publication:4207780
  • An algorithm for the solution of the two-route Johnson problem
  • An approximate algorithm for the three-machine problem
  • On the complexity of two machine job-shop scheduling with regular objective functions
  • An improved approximation scheme for the Johnson problem with parallel machines


zbMATH Keywords

NP-completenesstwo-machine Johnson problem


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)







This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4888940)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4888940&oldid=19261588"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 05:17. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki