000839350 000__ 03541cam\a2200505Ma\4500
000839350 001__ 839350
000839350 005__ 20230306144643.0
000839350 006__ m\\\\\o\\d\\\\\\\\
000839350 007__ cr\un\nnnunnun
000839350 008__ 180521s2018\\\\gw\a\\\\o\\\\\000\0\eng\d
000839350 019__ $$a1037063476
000839350 020__ $$a9783658223625$$q(electronic book)
000839350 020__ $$a3658223626$$q(electronic book)
000839350 020__ $$z9783658223618
000839350 020__ $$z3658223618
000839350 035__ $$aSP(OCoLC)on1036733581
000839350 035__ $$aSP(OCoLC)1036733581$$z(OCoLC)1037063476
000839350 040__ $$aYDX$$beng$$cYDX$$dN$T$$dEBLCP$$dCOO$$dUAB$$dOCLCF$$dDEFHM
000839350 049__ $$aISEA
000839350 050_4 $$aTA1225
000839350 08204 $$a387.153$$223
000839350 1001_ $$aMeiswinkel, Sebastian.
000839350 24510 $$aOn combinatorial optimization and mechanism design problems arising at container ports /$$cSebastian Meiswinkel ; with a foreword by Prof. Dr. Erwin Pesch.
000839350 260__ $$aWiesbaden :$$bSpringer Gabler,$$c©2018.
000839350 300__ $$a1 online resource :$$billustrations.
000839350 336__ $$atext$$btxt$$2rdacontent
000839350 337__ $$acomputer$$bc$$2rdamedia
000839350 338__ $$aonline resource$$bcr$$2rdacarrier
000839350 4901_ $$aProduktion und Logistik
000839350 4901_ $$aResearch
000839350 504__ $$aIncludes bibliographical references.
000839350 5050_ $$aIntro; Foreword; Preface; Contents; List of Figures; List of Tables; 1 Introduction and Preliminaries; 1.1 Notation and Terminology; 1.1.1 Machine Scheduling; 1.1.2 Mechanism Design; 1.1.3 Graph Theory; 1.2 Outline; 2 Mechanism Design and Machine Scheduling: Literature Review; 2.1 Scope of Review; 2.2 Review of Problem Categories and Features; 2.2.1 Categories, Risk Attitude and Private Information of Agents; 2.2.2 Models of Execution and Constraints on Committed Data; 2.2.3 Characteristics of Payment Schemes; 2.2.4 Other Problem Categories and Features; 2.3 Classification Scheme
000839350 5058_ $$a2.3.1 Review of Selected Elements of Graham et al. (1979)2.3.2 Including Mechanism Design Settings for Machine Scheduling Problems; 2.3.3 Examples; 2.4 Literature Overview; 2.5 Research Challenges and Conclusion; 3 Truthful Algorithms for Job Agents; 3.1 Related Literature; 3.2 One-Parameter Job Agents; 3.2.1 Problem Setting and Preliminaries; 3.2.2 Monotonicity and List-Scheduling Algorithms; 3.2.3 Multiple Parallel Machines; 3.2.4 One Machine; 3.3 Two-Parameter Job Agents; 3.3.1 Problem Setting and Preliminaries; 3.3.1.1 Scheduling and Mechanism Design Domain; 3.3.1.2 Additional notation
000839350 5058_ $$a4.3.3 Partition-Match Heuristics4.3.4 Match-Partition Heuristics; 4.4 Computational Results; 4.5 Conclusion; 5 Straddle Carrier Routing at Container Ports with Quay Crane Buffers; 5.1 Related Literature; 5.2 Detailed Problem Definition; 5.2.1 Problem Setting and Assumptions; 5.2.2 Notation and Detailed Problem Description; 5.2.3 A Mixed-Integer Program; 5.3 Computational Complexity; 5.4 Algorithms; 5.4.1 Initial Solution; 5.4.2 Routing Problem; 5.4.3 Fast Heuristic for Times and Buffer Capacities; 5.5 Computational Results; 5.5.1 Comparison of Algorithms; 5.5.2 Comparison with Practice
000839350 5058_ $$a5.6 Conclusion6 Summary and Outlook; Bibliography
000839350 506__ $$aAccess limited to authorized users.
000839350 650_0 $$aTerminals (Transportation)
000839350 650_0 $$aContainerization.
000839350 77608 $$iPrint version:$$z3658223618$$z9783658223618$$w(OCoLC)1034619176
000839350 830_0 $$aProduktion und Logistik.
000839350 830_0 $$aResearch (Wiesbaden, Germany)
000839350 852__ $$bebk
000839350 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-658-22362-5$$zOnline Access$$91397441.1
000839350 909CO $$ooai:library.usi.edu:839350$$pGLOBAL_SET
000839350 980__ $$aEBOOK
000839350 980__ $$aBIB
000839350 982__ $$aEbook
000839350 983__ $$aOnline
000839350 994__ $$a92$$bISE