Supply chain scheduling: Conflict and cooperation in assembly systems

Operations Research

Volumn 55, Issue 6, 2007, Pages 1072-1089

  Chen, Zhi Long ^a   Hall, Nicholas G ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

Cooperation: benefit; Cost of conflict; Decision making: cooperation; Supply chain scheduling

Indexed keywords

ASSEMBLY SYSTEMS; COST OF CONFLICT; NONBOTTLENECK OPERATIONS;

ASYMPTOTIC ANALYSIS; DECISION MAKING; MANUFACTURE; PROBLEM SOLVING; SCHEDULING;

SUPPLY CHAINS;

EID: 38549131389     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1070.0412     Document Type: Article

References (32)

1. Agnetis, A., N. G. Hall, D. Pacciarelli. 2006. Supply chain scheduling: Sequence coordination. Discrete Appl. Math. 154 2044-2063.
2. Cachon, G. P. 2003. Supply chain coordination with contracts. A. G. de Kok, S. C. Graves, eds. Supply Chain Management: Design, Coordination, and Operation, Vol. 11. North-Holland, Amsterdam, The Netherlands, 229-339.
3. Chen, F. 2003. Information sharing and supply chain coordination. A. G. de Kok, S. C. Graves, eds. Supply Chain Management: Design, Coordination, and Operation, Vol. 11. North-Holland, Amsterdam, The Netherlands, 341-421.
4. Dawande, M., H. N. Geismar, N. G. Hall, C. Sriskandarajah. 2006. Supply chain scheduling: Distribution systems. Production Oper. Management 15 243-261.
5. The Economist. 2001. A long march to mass customisation. 360(8230, July 14) 63.
6. Electronic Business News. 2001. VPT stresses standard approach for mil apps - Power supplier girds for possible defense buildup. (1284, October 15) 74.
7. Feld, W. M. 2000. Lean Manufacturing: Tools, Techniques and How to Use Them. CRC Press. http://www.crcpress.com.
8. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, CA.
9. Gavirneni, S., R. Kapuscinski, S. Tayur. 1999. Value of information in capacitated supply chains. Management Sci. 45 16-24.
10. Graham, R. L., E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan. 1979. Optimization and approximation in deterministic machine scheduling: A survey. Ann. Discrete Math. 5 287-326.
11. Hall, N. G., C. N. Potts. 2003. Supply chain scheduling: Batching and delivery. Oper. Res. 51 566-584.
12. Hoogeveen, J. A., S. L. van de Velde. 1995. Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Oper. Res. Lett. 17 205-208.
13. Hopp, W. J., M. L. Spearman. 2000. Factory Physics, 2nd ed. Irwin McGraw-Hill, New York.
14. Jackson, J. R. 1955. Scheduling a production line to minimize maximum tardiness. Research Report 43, Management Science Research Project, University of California, Los Angeles, CA.
15. Kaminsky, P., D. Simchi-Levi. 1998. Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem. Oper. Res. 46 872-882.
16. Koulamas, C., S. R. Antony, R. Jaen. 1994. A survey of simulated annealing applications to operations research problems. Omega 22 41-56.
17. Kraemer, K. L., J. Dedrick. 2002. Dell computer: Organization of a global production network. Working paper, Center for Research on Information Technology and Organizations, University of California, Irvine, CA.
18. Lane, D. E., J. B. Sidney. 1993. Batching and scheduling in FMS hubs: Flow time considerations. Oper. Res. 41 1091-1103.
19. Lee, C.-Y., Z.-L. Chen. 2001. Machine scheduling with transportation considerations. J. Scheduling 4 3-24.
20. Lee, C.-Y., T. C. E. Cheng, B. M. T. Lin. 1993. Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Management Sci. 39 616-625.
21. Lenstra, J. K., A. H. G. Rinnooy Kan, P. Brucker. 1977. Complexity of machine scheduling problems. Ann. Discrete Math. 1 343-362.
22. Nash, J. F. 1950. The bargaining problem. Econometrica 18 155-162.
23. Nash, J. F. 1953. Two-person cooperative games. Econometrica 21 128-140.
24. Ng, C. T. D., T. C. E. Cheng, M. Y. Kovalyov. 2003. Batch scheduling with controllable setup and processing times to minimize total completion time. J. Oper. Res. Soc. 54 499-506.
25. Ow, P. S., S. F. Smith, R. Howie. 1988. A cooperative scheduling system. M. D. Oliff, ed. Expert Systems and Intelligent Manufacturing. Elsevier Science Publishing, Amsterdam, The Netherlands, 43-56.
26. Pinedo, M. L., X. Chao. 1999. Operations Scheduling with Applications in Manufacturing and Services. Irwin McGraw-Hill, New York.
27. Potts, C. N., S. V. Sevast'janov, V. A. Strusevich, L. N. Van Wassenhove, C. M. Zwaneveld. 1995. The two-stage assembly scheduling problem: Complexity and approximation. Oper. Res. 43 346-355.
28. Rajagopalan, S., A. Malhotra. 2001. Have U.S. manufacturing inventories really decreased? An empirical study. Manufacturing Service Oper. Management 3 14-24.
29. Sarmiento, A. M., R. Nagi. 1999. A review of integrated analysis of production-distribution systems. IIE Trans. 31 1061-1074.
30. Smith, W. E. 1956. Various optimizers for single stage production. Naval Res. Logist. Quart. 3 59-66.
31. Stein, T., J. Sweat. 1998. Killer supply chains. Information Week (November 9).
32. Thomas, D. J., P. M. Griffin. 1996. Coordinated supply chain management. Eur. J. Oper. Res. 94 1-15.