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

Optimal job-shop scheduling with two jobs in systems with unrestricted paths

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

zbMath0799.90067MaRDI QIDQ1323959

Natalia V. Shakhlevich, Vitaly A. Strusevich

Publication date: 6 July 1994

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)



zbMATH Keywords

optimal job-shop scheduling


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)


Related Items (1)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches







This page was built for publication: Optimal job-shop scheduling with two jobs in systems with unrestricted paths

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