scientific article; zbMATH DE number 3708084

MaRDI QIDQ3899809zbMATH OpenFDO

Authors Sergey Sevastyanov

Publication date 1978

zbMATH Keywords

computational complexitycounter-routes problemJohnson's problemm machinesn jobsscheduling

Mathematics Subject Classification ID

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

Cited in

(14)

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

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)