IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v54y2016i9p2691-2708.html
   My bibliography  Save this article

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

Author

Listed:
  • Heng Kuang
  • S. Jack Hu
  • Jeonghan Ko

Abstract

As manufacturers face fierce competition in the global market, responsiveness has become an important competitiveness factor in addition to quality and cost. One essential responsiveness strategy is to reduce product development and lead times by integrating assembly planning with supplier assignment. This paper addresses the problem of integrated assembly and supply chain design under lead-time constraints by formulating and solving an optimisation problem with minimal total supply chain costs. This new time-constrained joint optimisation problem belongs to an NP-hard resource-constrained scheduling problem. To model this problem effectively, we develop a novel Hyper AND/OR graph and apply it for integrating assembly and supply chain decisions. We also develop a dynamic programming model and associated algorithm in order to solve the integrated optimisation problem with pseudo-polynomial time complexity in practice. Numerical case studies validate that the methods developed can solve the integrated decision-making problem optimally and efficiently. This paper overcomes the limitations of previous studies on concurrent assembly decomposition and supplier selection, which optimises cost without time constraints. The models and results of this research can be applied to a variety of areas including assembly design, maintenance module planning and supply chain restructuring.

Suggested Citation

  • Heng Kuang & S. Jack Hu & Jeonghan Ko, 2016. "A dynamic programming approach to integrated assembly planning and supplier assignment with lead time constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 54(9), pages 2691-2708, May.
    • Handle: RePEc:taf:tprsxx:v:54:y:2016:i:9:p:2691-2708
    DOI: 10.1080/00207543.2015.1118575
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2015.1118575
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2015.1118575?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Thomas J. Hindelang & John F. Muth, 1979. "A Dynamic Programming Algorithm for Decision CPM Networks," Operations Research, INFORMS, vol. 27(2), pages 225-241, April.
    2. Hartmann, Sonke & Kolisch, Rainer, 2000. "Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 127(2), pages 394-407, December.
    3. Edward W. Davis & James H. Patterson, 1975. "A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling," Management Science, INFORMS, vol. 21(8), pages 944-955, April.
    4. Avella, Pasquale & Boccia, Maurizio & Sforza, Antonio, 2002. "A penalty function heuristic for the resource constrained shortest path problem," European Journal of Operational Research, Elsevier, vol. 142(2), pages 221-230, October.
    5. Don R. Robinson, 1975. "A Dynamic Programming Solution to Cost-Time Tradeoff for CPM," Management Science, INFORMS, vol. 22(2), pages 158-166, October.
    6. Bouleimen, K. & Lecocq, H., 2003. "A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version," European Journal of Operational Research, Elsevier, vol. 149(2), pages 268-281, September.
    7. Doran, Desmond & Hill, Alex & Hwang, Ki-Soon & Jacob, Gregoire, 2007. "Supply chain modularisation: Cases from the French automobile industry," International Journal of Production Economics, Elsevier, vol. 106(1), pages 2-11, March.
    8. Hartmann, Sönke & Kolisch, R., 2000. "Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 11180, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ben-Ammar, Oussama & Bettayeb, Belgacem & Dolgui, Alexandre, 2019. "Optimization of multi-period supply planning under stochastic lead times and a dynamic demand," International Journal of Production Economics, Elsevier, vol. 218(C), pages 106-117.
    2. Oussama Ben-Ammar & Belgacem Bettayeb & Alexandre Dolgui, 2019. "Integrated production planning and quality control for linear production systems under uncertainties of cycle time and finished product quality," Post-Print hal-02415341, HAL.
    3. Ben-Ammar, Oussama & Dolgui, Alexandre & Wu, Desheng Dash, 2018. "Planned lead times optimization for multi-level assembly systems under uncertainties," Omega, Elsevier, vol. 78(C), pages 39-56.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kolisch, Rainer & Hartmann, Sonke, 2006. "Experimental investigation of heuristics for resource-constrained project scheduling: An update," European Journal of Operational Research, Elsevier, vol. 174(1), pages 23-37, October.
    2. Chen, Jiaqiong & Askin, Ronald G., 2009. "Project selection, scheduling and resource allocation with time dependent returns," European Journal of Operational Research, Elsevier, vol. 193(1), pages 23-34, February.
    3. Dieter Debels & Mario Vanhoucke, 2007. "A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem," Operations Research, INFORMS, vol. 55(3), pages 457-469, June.
    4. Debels, Dieter & De Reyck, Bert & Leus, Roel & Vanhoucke, Mario, 2006. "A hybrid scatter search/electromagnetism meta-heuristic for project scheduling," European Journal of Operational Research, Elsevier, vol. 169(2), pages 638-653, March.
    5. Hartmann, Sönke & Briskorn, Dirk, 2010. "A survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 1-14, November.
    6. Van Peteghem, Vincent & Vanhoucke, Mario, 2014. "An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances," European Journal of Operational Research, Elsevier, vol. 235(1), pages 62-72.
    7. Lova, Antonio & Tormos, Pilar & Cervantes, Mariamar & Barber, Federico, 2009. "An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes," International Journal of Production Economics, Elsevier, vol. 117(2), pages 302-316, February.
    8. Alfredo S. Ramos & Pablo A. Miranda-Gonzalez & Samuel Nucamendi-Guillén & Elias Olivares-Benitez, 2023. "A Formulation for the Stochastic Multi-Mode Resource-Constrained Project Scheduling Problem Solved with a Multi-Start Iterated Local Search Metaheuristic," Mathematics, MDPI, vol. 11(2), pages 1-25, January.
    9. Debels, Dieter & Vanhoucke, Mario, 2005. "A Bi-Population Based Genetic Algorithm for the Resource-Constrained Project Scheduling Problem," Vlerick Leuven Gent Management School Working Paper Series 2005-8, Vlerick Leuven Gent Management School.
    10. Buddhakulsomsiri, Jirachai & Kim, David S., 2006. "Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting," European Journal of Operational Research, Elsevier, vol. 175(1), pages 279-295, November.
    11. V. Van Peteghem & M. Vanhoucke, 2008. "A Genetic Algorithm for the Multi-Mode Resource-Constrained Project Scheduling Problem," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 08/494, Ghent University, Faculty of Economics and Business Administration.
    12. Linfang Shen & Kuoyu Liu & Jinfei Chai & Weibin Ma & Xiaoxiong Guo & Yao Li & Peng Zhao & Boying Liu, 2022. "Research on the Mathematical Model for Optimal Allocation of Human Resources in the Operation and Maintenance Units of a Heavy Haul Railway," Mathematics, MDPI, vol. 10(19), pages 1-18, October.
    13. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    14. Hartmann, Sönke & Briskorn, Dirk, 2008. "A survey of variants and extensions of the resource-constrained project scheduling problem," Working Paper Series 02/2008, Hamburg School of Business Administration (HSBA).
    15. Zheng, Huan-yu & Wang, Ling, 2015. "Reduction of carbon emissions and project makespan by a Pareto-based estimation of distribution algorithm," International Journal of Production Economics, Elsevier, vol. 164(C), pages 421-432.
    16. Peteghem, Vincent Van & Vanhoucke, Mario, 2010. "A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 201(2), pages 409-418, March.
    17. He, Zhengwen & Wang, Nengmin & Jia, Tao & Xu, Yu, 2009. "Simulated annealing and tabu search for multi-mode project payment scheduling," European Journal of Operational Research, Elsevier, vol. 198(3), pages 688-696, November.
    18. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    19. Moumene, Khaled & Ferland, Jacques A., 2009. "Activity list representation for a generalization of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 199(1), pages 46-54, November.
    20. Weglarz, Jan & Józefowska, Joanna & Mika, Marek & Waligóra, Grzegorz, 2011. "Project scheduling with finite or infinite number of activity processing modes - A survey," European Journal of Operational Research, Elsevier, vol. 208(3), pages 177-205, February.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tprsxx:v:54:y:2016:i:9:p:2691-2708. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.