Intro; 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

2.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

4.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

5.6 Conclusion6 Summary and Outlook; Bibliography