Access the full text.
Sign up today, get DeepDyve free for 14 days.
G. Ma, Yunfeng Zhang, A. Nee (2000)
A simulated annealing-based optimization algorithm for process planningInternational Journal of Production Research, 38
Z. Othman, Khairanum Subari, N. Morad (2002)
Application of fuzzy inference systems and genetic algorithms in integrated process planning and schedulingThe International Journal of the Computer, the Internet and Management, 10
M. Gendreau, J. Potvin (2005)
Metaheuristics in Combinatorial OptimizationAnnals of Operations Research, 140
Gareth Palmer (1996)
A simulated annealing approach to integrated production schedulingJournal of Intelligent Manufacturing, 7
Y. Guo, A. Mileham, G. Owen, Weidong Li (2009)
Applications of particle swarm optimisationin integrated process planning and scheduling
Weidong Li, C. McMahon (2007)
A simulated annealing-based optimization approach for integrated process planning and schedulingInternational Journal of Computer Integrated Manufacturing, 20
G. Prabhaharan, B. Khan, L. Rakesh (2006)
Implementation of grasp in flow shop schedulingThe International Journal of Advanced Manufacturing Technology, 30
K. Ueda, N. Fujii, R. Inoue (2007)
An Emergent Synthesis Approach to Simultaneous Process Planning and SchedulingCirp Annals-manufacturing Technology, 56
X.-D. Zhang, H. Yan (2005)
Integrated optimization of production planning and scheduling for a kind of job-shopThe International Journal of Advanced Manufacturing Technology, 26
Ajai Jain, P. Jain, I. Singh (2006)
An integrated scheme for process planning and scheduling in FMSThe International Journal of Advanced Manufacturing Technology, 30
Wei Tan, B. Khoshnevis (2000)
Integration of process planning and scheduling— a reviewJournal of Intelligent Manufacturing, 11
H. Choi, Byung Park (2006)
Integration of process planning and job shop scheduling using genetic algorithm
A. Baykasoğlu, Lale Özbakır (2009)
A grammatical optimization approach for integrated process planning and schedulingJournal of Intelligent Manufacturing, 20
Skylab Gupta, Jeffrey Smith (2006)
Algorithms for single machine total tardiness scheduling with sequence dependent setupsEur. J. Oper. Res., 175
Renata Aiex, S. Binato, M. Resende (2003)
Parallel GRASP with path-relinking for job shop schedulingParallel Comput., 29
Michael Argüello, J. Bard, Gang Yu (1997)
A Grasp for Aircraft Routing in Response to Groundings and DelaysJournal of Combinatorial Optimization, 1
B. Khoshnevis, Qingmei Chen (1991)
Integration of process planning and scheduling functionsJournal of Intelligent Manufacturing, 2
Samuel Huang, Hongchao Zhang, Milton Smith (1995)
A progressive approach for the integration of process planning and schedulingIie Transactions, 27
T. Wong, Chi-wah. Leung, K. Mak, R. Fung (2006)
An agent-based negotiation approach to integrate process planning and schedulingInternational Journal of Production Research, 44
N. Morad, Ams Zalzala (1999)
Genetic algorithms in integrated process planning and schedulingJournal of Intelligent Manufacturing, 10
L. Cagnina, S. Esquivel, R. Gallard (2004)
Particle swarm optimization for sequencing problems: a case studyProceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753), 1
J. Bard, K. Venkatraman, T. Feo (1993)
Single machine scheduling with flow time and earliness penaltiesJournal of Global Optimization, 3
Á. Corberán, R. Martí, J. Sanchis (2002)
A GRASP heuristic for the mixed Chinese postman problemEur. J. Oper. Res., 142
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)
International Journal of Manufacturing Research – Inderscience Publishers
Published: Jan 1, 2010
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.