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

Mishra, N., Kumar, V., Chan, Felix T.S. and 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). pp. 535-550. ISSN 0020-7543

Full text not available from this repository. (Request a copy)

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.

Item Type: Article
Faculty \ School: Faculty of Social Sciences > Norwich Business School
Related URLs:
Depositing User: Pure Connector
Date Deposited: 06 Nov 2015 11:00
Last Modified: 25 Jul 2018 11:16
URI: https://ueaeprints.uea.ac.uk/id/eprint/55018
DOI: 10.1080/00207543.2010.543176

Actions (login required)

View Item