Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 55, No. 6, November-December 2007, pp. 1072-1089
DOI: 10.1287/opre.1070.0412
This Article
Right arrow Full Text (PDF)
Right arrow e-companion
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Chen, Z.-L.
Right arrow Articles by Hall, N. G.
Right arrow Search for Related Content

Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems

Zhi-Long Chen, Nicholas G. Hall

Robert H. Smith School of Business, University of Maryland, College Park, Maryland 20742-1815
Fisher College of Business, The Ohio State University, Columbus, Ohio 43210-1144

zchen{at}rhsmith.umd.edu
hall.33{at}osu.edu

We study conflict and cooperation issues in supply chain manufacturing. Consider an assembly system where suppliers provide parts to a manufacturer. A product cannot be delivered until all its parts have been supplied. The manufacturer performs nonbottleneck operations, for example, outsourced assembly, packaging, and delivery for each product. Two classical scheduling objectives are considered: minimization of the total completion time and of the maximum lateness. We analyze how far from optimal the best schedule for a suppliers' scheduling problem can be for the corresponding manufacturer's problem, and vice versa. To resolve these conflicts, we consider four alternative scenarios for the relative bargaining power of the suppliers and the manufacturer, and in each case describe a practical mechanism for cooperation between the decision makers. Evaluating the cost of conflict and the benefit of cooperation in these scenarios requires the solution of various scheduling problems by the suppliers, the manufacturer, and the overall system. For all these scheduling problems, we provide either an efficient algorithm or a proof of intractability. Moreover, for two problems that we show are intractable, we describe heuristics and analyze their worst case performance or demonstrate asymptotic optimality of their solutions. We demonstrate computationally that the cost saving realized by cooperation between the decision makers is significant in many cases. Extensions of our models to consider bottleneck operations at the manufacturer and transportation times are also developed.

Subject classifications: supply chain scheduling; decision making; cooperation; cost of conflict; cooperation; benefit.
History: Received September 2004; revision received September 2006; accepted October 2006.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2007 by INFORMS.