Outbound Scheduling Problem and Its Heuristic Algorithm

This paper studied the problem occurring in outbound logistics.The scheduling model for the problem was established,which moreover was proved to be strongly NP-hard.By analyzing the characters of the problem,a heuristic was presented and its worst performance ratio was proved to be 3 and tight.Computational experiments were given to show the efficiency of the algorithm.