Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks

Abstract:

Article Preview

Hybrid flow shop scheduling problems with multiprocessor tasks to minimize the makespan have been addressed and solved efficiently. Several approaches were used, including greedy methods and metaheuristics. In this paper, we proposed a mixed integer programming (MIP) model that can define explicitly and precisely the nature of a given problem. We also addressed a modified lower bound to obtain tighter bounds. Additionally, we propose different decoding methods and emphasize their importance in hybrid flow shop scheduling problems with multiprocessor tasks. By using existing test problems with n=5 in examining the proposed methods, many optimal solutions can be obtained as benchmarks for reference by the MIP model. Accordingly, the results are indicative of the influence of the decoding methods on the solutions to the hybrid flow shop problems with multiprocessor tasks.

Info:

Periodical:

Edited by:

Wu Fan

Pages:

3914-3921

DOI:

10.4028/www.scientific.net/AMM.110-116.3914

Citation:

H. M. Wang et al., "Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks", Applied Mechanics and Materials, Vols. 110-116, pp. 3914-3921, 2012

Online since:

October 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.