Branch and Bound Method with Heuristic Algorithm for a Special Flexible Flow Shop Scheduling Problem

Abstract:

Article Preview

This paper deals with an optimal method for solving a 2-stage flexible flow shop scheduling problem with group constraint, batch released dates. This problem is known to be NP-hard. In this paper, first of all, we construct a mathematical model for the problem. Then, we develop a branch and bound method with heuristic algorithm for the optimal solution of the problem. During the initialization, we use a heuristic algorithm H’ as the initial solution. We propose two branching algorithms in the branching procedure and two algorithms for the lower bound. We also propose a set of instances for this type of problem. The results are shown that our branch and bound method is effective for small and medium-sized problem but large-sized problem.

Info:

Periodical:

Advanced Materials Research (Volumes 139-141)

Edited by:

Liangchi Zhang, Chunliang Zhang and Tielin Shi

Pages:

1530-1534

DOI:

10.4028/www.scientific.net/AMR.139-141.1530

Citation:

Z. T. Li et al., "Branch and Bound Method with Heuristic Algorithm for a Special Flexible Flow Shop Scheduling Problem", Advanced Materials Research, Vols. 139-141, pp. 1530-1534, 2010

Online since:

October 2010

Export:

Price:

$35.00

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

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