Scheduling Problems in Cross Docking

Authors:
Rongjun Chen;Baoqiang Fan;Guochun Tang
Affiliations:
Department of Mathematics, Changzhou Institute of Technology, Changzhou, China 213002;Department of Mathematics and Information, Ludong University, Yantai, China 264025;Institute of Management Engineering, Shanghai Second Polytechnic University, Shanghai, China 201209
Venue:
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Year:
2009

Citing 2
Cited 1

Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
Multiple crossdocks with inventory and time windows

Computers and Operations Research

Advances in Truck Scheduling at a Cross Dock Facility

International Journal of Information Systems and Supply Chain Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.