Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems

References

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