A CBFSA approach to resolve the distributed manufacturing process planning problem in a supply chain environment

Mishra, N.; Kumar, V.; Chan, Felix T.S.; Tiwari, M. K.

Abstract

In this competitive world cost and lead time reduction are of prime concern for manufacturing firms. To achieve this objective manufacturing entities are adopting several management philosophies such as Total Quality Management (TQM), just-in-time (JIT), and theory of constraints (TOC). The present paper addresses the advanced computer-aided process planning (ACAPP) problem in a distributed manufacturing supply chain environment and aims at cost and lead times reduction under several technological constraints. To deal with the complexity of the problem the constraint based fast simulated annealing (CBFSA) algorithm has been explored in this article. Extensive computations have been performed over the well-known benchmarks of advanced planning problems and the results obtained prove the superiority of the proposed algorithm over the prior approaches. © 2012 Copyright Taylor and Francis Group, LLC.

Citation

Mishra, N., Kumar, V., Chan, F. T., & Tiwari, M. K. (2012). A CBFSA approach to resolve the distributed manufacturing process planning problem in a supply chain environment. International Journal of Production Research, 50(2), 535-550. https://doi.org/10.1080/00207543.2010.543176

• Journal Article Type: Article
• Acceptance Date: Oct 18, 2010
• Online Publication Date: Nov 15, 2011
• Publication Date: Jan 15, 2012
• Deposit Date: Jun 8, 2022
• Journal: International Journal of Production Research
• Print ISSN: 0020-7543
• Publisher: Taylor and Francis
• Peer Reviewed: Peer Reviewed
• Volume: 50
• Issue: 2
• Pages: 535-550
• DOI: https://doi.org/10.1080/00207543.2010.543176
• Keywords: Process plan; Distributed manufacturing supply chain; Lead time; Cost; CAPP
• Public URL: https://hull-repository.worktribe.com/output/3614000