Zur Kurzanzeige

dc.contributor.authorMeier, Leif
dc.contributor.authorSchumann, René
dc.contributor.editorKoschke, Rainer
dc.contributor.editorHerzog, Otthein
dc.contributor.editorRödiger, Karl-Heinz
dc.contributor.editorRonthaler, Marc
dc.date.accessioned2019-05-15T09:15:38Z
dc.date.available2019-05-15T09:15:38Z
dc.date.issued2007
dc.identifier.isbn978-3-88579-206-1
dc.identifier.issn1617-5468
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/22620
dc.description.abstractThe decomposition of planning and scheduling problems is a well known technique to make these problems tractable. The resulting dependable subproblems were often solved using different planning systems. In this article we focus on an example from the container terminal management. We point out the dependencies between the planning systems. Using a subset of the container terminal management problem we show that an uncoordinated or only naively coordinated solution is not sufficient to generate feasible or effective plans.en
dc.language.isoen
dc.publisherGesellschaft für Informatik e. V.
dc.relation.ispartofInformatik 2007 – Informatik trifft Logistik – Band 1
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-109
dc.titleCoordination of Interdependent Planning Systems, a Case Studyen
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages389-396
mci.conference.sessiontitleRegular Research Papers
mci.conference.locationBremen
mci.conference.date24.-27. September 2007


Dateien zu dieser Ressource

Thumbnail

Zur Kurzanzeige