In this paper we study a cross-docking problem minimizing the total flow time of inbound and outbound jobs. Using the theories and methodologies of scheduling, we formulate the problem into a two-stage scheduling problem and propose heuristics with worst-case performance analysis under parallel, uniform and open-shop machines, respectively. For each of problems studied, some polynomially solvable special cases are also introduced.
Swipe to navigate through the chapters of this book
Please log in to get access to this content
To get access to this content you need the following product:
- Scheduling Problems in Cross Docking
- Springer Berlin Heidelberg
- Sequence number
Neuer Inhalt/© ITandMEDIA