A Heuristics Based on RA for Two-Stage Flexible Flow Shop Scheduling with Head Group Constraint

Abstract:

Article Preview

Rapid access (RA) is an effective heuristic method for solving the permutation flow shop problem with the objective of makespan. This paper proposes a heuristic IRA (i.e., improved RA) for the two-stage flexible flow shop scheduling problem with head group constraint. In the heuristic IRA, two dispatch rules, i.e., earliest completion time first (ECT)) and earliest start time first (EST), are proposed for allocating devices for tasks. Benchmark testing results show that using ECT dispatch rule can significantly improve the performance of heuristic IRA. As comparison, the heuristic CDS and heuristic Palmer have also simulated under the same conditions, and the results show that the IRA is able to provide much better performance.

Info:

Periodical:

Edited by:

Di Zheng, Yiqiang Wang, Yi-Min Deng, Aibing Yu and Weihua Li

Pages:

783-789

DOI:

10.4028/www.scientific.net/AMM.101-102.783

Citation:

Z. T. Li et al., "A Heuristics Based on RA for Two-Stage Flexible Flow Shop Scheduling with Head Group Constraint", Applied Mechanics and Materials, Vols. 101-102, pp. 783-789, 2012

Online since:

September 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.