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

scientific article

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

zbMATH Open0771.90057MaRDI QIDQ4012347

Michail M. Kovalev, V. Khoppe

Publication date: 27 September 1992



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


zbMATH Keywords

polynomial-time algorithmsbatching problemmethod of partial orderspolygon schedulingpolymatroid approach


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)



Related Items (3)

Scheduling problems with non-regular penalty functions - a review ⋮ On not-first/not-last conditions in disjunctive scheduling ⋮ Non‐dominated “trade‐off” solutions in television scheduling optimization






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

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