Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/11960
Title: A CBFSA approach to resolve the distributed manufacturing process planning problem in a supply chain environment
Authors: Mishra, N
Kumar, V
Chan, FTS 
Tiwari, MK
Issue Date: 2012
Source: International journal of production research, 2012, v. 50, no. 2, p. 535-550
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.
Keywords: CAPP
cost
distributed manufacturing supply chain
lead time
process plan
Publisher: Taylor & Francis
Journal: International journal of production research 
ISSN: 0020-7543
EISSN: 1366-588X
DOI: 10.1080/00207543.2010.543176
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

4
Last Week
0
Last month
0
Citations as of Sep 4, 2020

WEB OF SCIENCETM
Citations

4
Last Week
0
Last month
0
Citations as of Sep 19, 2020

Page view(s)

130
Last Week
0
Last month
Citations as of Sep 16, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.