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 3708084

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

zbMATH Open0452.90033MaRDI QIDQ3899809FDOQ3899809


Authors: Sergey Sevastyanov Edit this on Wikidata


Publication date: 1978



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




zbMATH Keywords

computational complexityschedulingn jobsm machinesJohnson's problemcounter-routes problem


Mathematics Subject Classification ID

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



Cited In (13)

  • Forcing \(k\)-repetitions in degree sequences
  • Small subset sums
  • Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory
  • On some combinatorial questions in finite-dimensional spaces
  • The flow shop problem with no-idle constraints: a review and approximation
  • Zero-sum subsequences in bounded-sum \(\{-1,1\}\)-sequences
  • On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems
  • Vector summation within minimal angle
  • To the Steinitz lemma in coordinate form
  • Transmitting in the \(n\)-dimensional cube
  • On some geometric methods in scheduling theory: A survey
  • The Open Shop Scheduling Problem
  • On Integer Programming and Convolution.





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 Q3899809)

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