Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The Lockmaster's problem

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

DOI10.4230/OASIcs.ATMOS.2011.27zbMath1247.90039OpenAlexW2522602053MaRDI QIDQ2917255

Sofie Coene, Frits C. R. Spieksma

Publication date: 28 September 2012

Full work available at URL: https://doi.org/10.4230/oasics.atmos.2011.27


zbMATH Keywords

complexitydynamic programmingbatch schedulinglock scheduling


Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39)


Related Items (2)

The lockmaster's problem ⋮ Exact and heuristic methods for placing ships in locks







This page was built for publication: The Lockmaster's problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2917255&oldid=15890944"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 20:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki