A CBFSA Approach to Resolve Distributed Manufacturing Process Planning Problem in Supply Chain Environment

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

Research output: Contribution to journalArticlepeer-review

5 Citations (SciVal)

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.
Original languageEnglish
Pages (from-to)535-550
JournalInternational Journal of Production Research
Volume50
Issue number2
Early online date15 Nov 2011
DOIs
Publication statusPublished - 2012

Keywords

  • process plan
  • distributed manufacturing supply chain
  • lead time
  • cost
  • CAPP

Fingerprint

Dive into the research topics of 'A CBFSA Approach to Resolve Distributed Manufacturing Process Planning Problem in Supply Chain Environment'. Together they form a unique fingerprint.

Cite this