A dynamic programming approach to integrated assembly planning and supplier assignment with lead time constraints

References

• Avella, P., M. Boccia, and A. Sforza. 2002. “A Penalty Function Heuristic for the Resource Constrained Shortest Path Problem.” European Journal of Operational Research 142 (2): 221–230.10.1016/S0377-2217(02)00262-X
   Web of Science ®Google Scholar
• Beasley, J., and N. Christofides. 1989. “An Algorithm for the Resource Constrained Shortest Path Problem.” Networks 19 (4): 379–394.10.1002/(ISSN)1097-0037
   Web of Science ®Google Scholar
• Blackhurst, J., T. Wu, and P. O’Grady. 2005. “PCDM: A Decision Support Modeling Methodology for Supply Chain, Product and Process Design Decisions.” Journal of Operations Management 23 (3): 325–343.10.1016/j.jom.2004.05.009
   Web of Science ®Google Scholar
• Bouleimen, K., and H. Lecocq. 2003. “A New Efficient Simulated Annealing Algorithm for the Resource-constrained Project Scheduling Problem and its Multiple Mode Version.” European Journal of Operational Research 149 (2): 268–281.10.1016/S0377-2217(02)00761-0
   Web of Science ®Google Scholar
• Büyüközkan, G. 2012. “An Integrated Fuzzy Multi-criteria Group Decision-making Approach for Green Supplier Evaluation.” International Journal of Production Research 50 (11): 2892–2909.10.1080/00207543.2011.564668
   Web of Science ®Google Scholar
• Che, Z. H. 2010. “A Genetic Algorithm-based Model for Solving Multi-period Supplier Selection Problem with Assembly Sequence.” International Journal of Production Research 48 (15): 4355–4377.10.1080/00207540903049399
   Web of Science ®Google Scholar
• Christofides, N. 1975. Graph Theory: An Algorithmic Approach. 8 vols. New York: Academic Press.
   Google Scholar
• Davis, E. W., and J. H. Patterson. 1975. “A Comparison of Heuristic and Optimum Solutions in Resource-constrained Project Scheduling.” Management Science 21 (8): 944–955.10.1287/mnsc.21.8.944
   Web of Science ®Google Scholar
• Doran, D., A. Hill, K.-S. Hwang, G. Jacob, and Operations Research Group. 2007. “Supply Chain Modularisation: Cases from the French Automobile Industry.” International Journal of Production Economics 106 (1): 2–11.10.1016/j.ijpe.2006.04.006
   Web of Science ®Google Scholar
• Feillet, D., P. Dejax, M. Gendreau, and C. Gueguen. 2004. “An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints: Application to Some Vehicle Routing Problems.” Networks 44 (3): 216–229.10.1002/(ISSN)1097-0037
   Web of Science ®Google Scholar
• Fine, C. H., B. Golany, and H. Naseraldin. 2005. “Modeling Tradeoffs in Three-dimensional Concurrent Engineering: A Goal Programming Approach.” Journal of Operations Management 23 (3–4): 389–403.10.1016/j.jom.2004.09.005
   Web of Science ®Google Scholar
• Ganapathy, B. K., and C.-H. Goh. 1997. “A Hierarchical System of Performance Measures for Concurrent Engineering.” Concurrent Engineering 5 (2): 137–143.10.1177/1063293X9700500205
   Web of Science ®Google Scholar
• Garey, M., and D. Johnson. 1979. Computers and Intractability: A Guide to the Theory of Incompleteness. San Francisco, CA: HW Freeman and Company.
   Google Scholar
• Handler, G. Y., and I. Zang. 1980. “A Dual Algorithm for the Constrained Shortest Path Problem.” Networks 10 (4): 293–309.10.1002/(ISSN)1097-0037
   Web of Science ®Google Scholar
• Hartmann, S. 1998. “A Competitive Genetic Algorithm for Resource-constrained Project Scheduling.” Naval Research Logistics (NRL) 45 (7): 733–750.10.1002/(ISSN)1520-6750
   Web of Science ®Google Scholar
• Hartmann, S., and R. Kolisch. 2000. “Experimental Evaluation of State-of-the-art Heuristics for the Resource-constrained Project Scheduling Problem.” European Journal of Operational Research 127 (2): 394–407.10.1016/S0377-2217(99)00485-3
   Web of Science ®Google Scholar
• Hindelang, T. J., and J. F. Muth. 1979. “A Dynamic Programming Algorithm for Decision CPM Networks.” Operations Research 27 (2): 225–241.10.1287/opre.27.2.225
   Web of Science ®Google Scholar
• Homem de Mello, L. S., and A. C. Sanderson. 1990. AND/OR Graph Representation of Assembly Plans. IEEE Transactions on Robotics and Automation 6 (2): 188–199.
   Google Scholar
• Hu, S. J., J. Ko, L. Weyand, H. A. ElMaraghy, T. K. Lien, Y. Koren, H. Bley, G. Chryssolouris, N. Nasr, and M. Shpitalni. 2011. “Assembly System Design and Operations for Product Variety.” CIRP Annals – Manufacturing Technology 60 (2): 715–733.10.1016/j.cirp.2011.05.004
   Web of Science ®Google Scholar
• Huang, G. Q., X. Zhang, and L. Liang. 2005. “Towards Integrated Optimal Configuration of Platform Products, Manufacturing Processes, and Supply Chains.” Journal of Operations Management 23 (3): 267–290.10.1016/j.jom.2004.10.014
   Web of Science ®Google Scholar
• Joksch, H. C. 1966. “The Shortest Route Problem with Constraints.” Journal of Mathematical Analysis and Applications 14 (2): 191–197.10.1016/0022-247X(66)90020-5
   Web of Science ®Google Scholar
• Kuang, H., S. J. Hu, and J. Ko. Forthcoming. “Concurrent Design of Assembly Plans and Suply Chain Configurations using AND/OR Graphs and Dynamic Programming.” ASME Jounral of Manufacturing Science and Engineering.
   Google Scholar
• Lee, S. 1994. “Subassembly Identification and Evaluation for Assembly Planning.” IEEE Transactions on Systems, Man and Cybernetics 24 (3): 493–503.
   Web of Science ®Google Scholar
• Merkle, D., M. Middendorf, and H. Schmeck. 2002. “Ant Colony Optimization for Resource-constrained Project Scheduling.” IEEE Transactions on Evolutionary Computation 6 (4): 333–346.10.1109/TEVC.2002.802450
   Web of Science ®Google Scholar
• Möhring, R. H., and F. J. Radermacher. 1984. “Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization.” North-holland Mathematics Studies 95: 257–355.10.1016/S0304-0208(08)72966-9
   Google Scholar
• Ong, N. S., and Y. C. Wong. 1999. “Automatic Subassembly Detection from a Product Model for Disassembly Sequence Generation.” The International Journal of Advanced Manufacturing Technology 15 (6): 425–431.10.1007/s001700050086
   Web of Science ®Google Scholar
• Robinson, D. R. 1975. “A Dynamic Programming Solution to Cost-time Tradeoff for CPM.” Management Science 22 (2): 158–166.10.1287/mnsc.22.2.158
   Web of Science ®Google Scholar
• Sadeghieh, A., et al. 2012. “A Genetic Algorithm Based Grey Goal Programming (G3) Approach for Parts Supplier Evaluation and Selection.” International Journal of Production Research 50 (16): 4612–4630.10.1080/00207543.2011.616233
   Web of Science ®Google Scholar
• Shao, X., et al. 2009. “Integration of Process Planning and Scheduling – A Modified Genetic Algorithm-based Approach.” Computers & Operations Research 36 (6): 2082–2096.
   Web of Science ®Google Scholar
• Stalk, G. 1988. Time–the Next Source of Competitive Advantage. Harvard Business Review (July–August).
   Google Scholar
• Su, J. C., Y.-L. Chang, and M. Ferguson. 2005. “Evaluation of Postponement Structures to Accommodate Mass Customization.” Journal of Operations Management 23 (3): 305–318.10.1016/j.jom.2004.10.016
   Web of Science ®Google Scholar
• Winner, R. I., J. P.Pennell, H. E.Bertrand, and M. M. Slusarczuk 1988. “The Role of Concurrent Engineering in Weapons System Acquisition.” Alexandria, VA: Institute for Defense Analyses Report R-338. Institute for Defense Analyses.
   Google Scholar
• Zhang, W. 1989. “Representation of Assembly and Automatic Robot Planning by Petri Net.” IEEE Transactions on Systems, Man and Cybernetics 19 (2): 418–422.10.1109/21.31045
   Web of Science ®Google Scholar