A Hybrid Nested Partitions Algorithm Combing with Genetic Algorithm for Job Shop Flexible Resource Scheduling

Article Preview

Abstract:

In this paper, we formulate the Job Shop Flexible Resource Scheduling (JSFRS) problem, and presents a hybrid nested partitions algorithm combining genetic algorithm in sampling scheme for the JSFRS problem. The major part of this work is a generic partitioning scheme was implemented and the Resource Allocation Procedure was incorporated into the NP method framework. Simulation results support our theoretical results and illustrate that the hybrid nested partitions algorithm work as designed and the performance improvements associated with flexible resource scheduling are substantial.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 179-180)

Pages:

920-924

Citation:

Online since:

January 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] A. K. Sethi and S. P. Sethi, Flexibility in manufacturing: A survey, Internat. J. Flexible Manufacturing Systems, vol. 2, no. 1, pp.289-328, (2008).

Google Scholar

[2] C. Y. Lee, L. Lei and M. Pinedo, Current trends in deterministic scheduling, Ann. Oper. Res., vol. 70, pp.1-41, (2009).

Google Scholar

[3] R. L. Daniels and J. B. Mazzola, A tabu-search heuristic for the flexible-resource flow shop scheduling problem, Ann. Oper. Res. 41, pp.207-230, (2002).

DOI: 10.1007/bf02023075

Google Scholar

[4] R. L. Daniels and J. B. Mazzola, Flow shop scheduling with resource flexibility, Oper. Res. 42, pp.504-522, (2001).

DOI: 10.1287/opre.42.3.504

Google Scholar

[5] R. L. Daniels, B. J. Hoopes and J.B. Mazzola, Scheduling parallel manufacturing cells with resource flexibility, Management Sci 42, pp.1260-1276, (1996).

DOI: 10.1287/mnsc.42.9.1260

Google Scholar