This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Chen, Z.-L. Articles by Pundoor, G. Search for Related Content

Order Assignment and Scheduling in a Supply Chain

Department of Decision and Information Technologies, Robert H. Smith School of Business, University of Maryland, College Park, Maryland 20742-1815
FedEx Express, 3680 Hacks Cross Road, Building H, Memphis, Tennessee 38125
zchen{at}rhsmith.umd.edu
gpundoor{at}fedex.com

We consider the supply chain of a manufacturer who produces time-sensitive products that have a large variety, a short life cycle, and are sold in a very short selling season. The supply chain consists of multiple overseas plants and a domestic distribution center (DC). Retail orders are first processed at the plants and then shipped from the plants to the DC for distribution to domestic retailers. Due to variations in productivity and labor costs at different plants, the processing time and cost of an order are dependent on the plant to which it is assigned. We study the following static and deterministic order assignment and scheduling problem faced by the manufacturer before every selling season: Given a set of orders, determine which orders are to be assigned to each plant, find a schedule for processing the assigned orders at each plant, and find a schedule for shipping the completed orders from each plant to the DC, such that a certain performance measure is optimized. We consider four different performance measures, all of which take into account both delivery lead time and the total production and distribution cost. A problem corresponding to each performance measure is studied separately. We analyze the computational complexity of various cases of the problems by either proving that a problem is intractable or providing an efficient exact algorithm for the problem. We propose several fast heuristics for the intractable problems. We analyze the worst-case and asymptotic performance of the heuristics and also computationally evaluate their performance using randomly generated test instances. Our results show that the heuristics are capable of generating near-optimal solutions quickly.

Subject classifications: production/scheduling; approximation/heuristic; deterministic sequencing; manufacturing; performance/productivity; transportation; scheduling; programming; integer; algorithms; heuristic.
History: Received June 2003; revision received June 2004; accepted April 2005.

This article has been cited by other articles:

				K. E. Stecke and X. Zhao Production and Transportation Integration for a Make-to-Order Manufacturing Company with a Commit-to-Delivery Business Mode MSOM, January 1, 2007; 9(2): 206 - 224. [Abstract] [PDF]