Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A GRASP algorithm for the Integration of Process Planning and Scheduling in a flexible job-shop

A GRASP algorithm for the Integration of Process Planning and Scheduling in a flexible job-shop The Integration of Process Planning and Scheduling (IPPS) is an important research issue in achieving optimum manufacturing processes. In IPPS, vast search spaces and complex technical constraints prove to be significant barriers to the effectiveness of the processes. This paper proposes a Greedy Randomised Adaptive Search Procedures (GRASP) algorithm for the integration of process planning with production scheduling in a flexible job-shop environment. The GRASP algorithm is a metaheuristic characterised by multiple initialisations. Basically, it comprises two phases: construction phase and local search phase. For this work, the construction phase is considered through computational experiments. The performance of the presented algorithm is evaluated and compared with benchmark problem and the results demonstrate that the proposed algorithm is an effective and practical approach for the flexible job-shop. (Received 24 April 2009; Revised 14 October 2009; Accepted 5 November 2009) http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Manufacturing Research Inderscience Publishers

A GRASP algorithm for the Integration of Process Planning and Scheduling in a flexible job-shop

Loading next page...
 
/lp/inderscience-publishers/a-grasp-algorithm-for-the-integration-of-process-planning-and-vNmga1z03k

References (23)

Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd. All rights reserved
ISSN
1750-0591
eISSN
1750-0605
DOI
10.1504/IJMR.2010.031633
Publisher site
See Article on Publisher Site

Abstract

The Integration of Process Planning and Scheduling (IPPS) is an important research issue in achieving optimum manufacturing processes. In IPPS, vast search spaces and complex technical constraints prove to be significant barriers to the effectiveness of the processes. This paper proposes a Greedy Randomised Adaptive Search Procedures (GRASP) algorithm for the integration of process planning with production scheduling in a flexible job-shop environment. The GRASP algorithm is a metaheuristic characterised by multiple initialisations. Basically, it comprises two phases: construction phase and local search phase. For this work, the construction phase is considered through computational experiments. The performance of the presented algorithm is evaluated and compared with benchmark problem and the results demonstrate that the proposed algorithm is an effective and practical approach for the flexible job-shop. (Received 24 April 2009; Revised 14 October 2009; Accepted 5 November 2009)

Journal

International Journal of Manufacturing ResearchInderscience Publishers

Published: Jan 1, 2010

There are no references for this article.