Éú²úÓëÔËÊäЭͬµ÷¶È:Ä£ÐÍÓëËã·¨:models and algorithms

Preface
Chapter 1 Order Acceptance and Scheduling with Job Delivery Times and Machine Availability Constraints
1.1 Introduction
1.2 An Optimal Pseudo-polynomial Algorithm When mls Fixed
1.3 Non-approximability Results
1.4 An FPTAS to 1 I FB£¨1£©£¬rejl Cmax+¦²wj
1.5 APTASforl IFB£¨1£©£¬q Dmax
1.6 When UIs and Als Are Identical and Periodic
1.7 Summary and Discussion
References

Chapter 2 Inbound Logistics Scheduling for Milk Runs with Limited Unloading Capacity
2.1 Introduction
2.2 Problem Description
2.3 Algorithm Development
2.4 Computational Results
2.5 Summary and Discussion
References

Chapter 3 Machine Scheduling with Raw Material Pickup and Finished Job Delivery
3.1 Introduction
3.2 Properties of the Model
3.3 Two Important Special Cases
3.4 Heuristic for the General Problem
3.5 Computational Experiments
3.6 Summary and Discussion
References

Chapter 4 Coordinated Scheduling of Customer Orders with Decentralized Machine Locations
4.1 Introduction
4.2 The Model and Its Properties
4.3 A Simple Heuristic Algorithm
4.4 Variants of Problem P
4.5 An Improved Heuristic for Problem P
4.6 Computational Experiments
4.7 Summary and Discussion
References

Chapter 5 Coordinated Scheduling of Truck Arrivals at an Air Cargo Terminal
5.1 Introduction to the Air Cargo Operations of HKIA
5.2 Problem Description and Formulation
5.3 An Enumerative Solution to SSP
5.4 A Dual-based Solution to TASP
5.5 Computational Experiments
5.6 Summary
References
Appendix A£º Some Basic Concepts in Computational Complexity Theory
Appendix B£º A Brief Introduction to Machine Scheduling