Paper Title:
Branch and Bound Method with Heuristic Algorithm for a Special Flexible Flow Shop Scheduling Problem
  Abstract

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, F. Hong, Q. X. Chen, N. Mao, "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
$32.00
Share

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

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

Authors: Zhi Qiang Xie, Jing Yang, Yu Jing He, Guang Jie Ye
Abstract:Aiming at the dynamic integrated scheduling problem of complex multi-products with different arriving time and identical machines, an...
897
Authors: Chun Yu Ren
Abstract:The paper is focused on the Min-Max Vehicle Routing Problem (MMVRP). Tabu search algorithm is an algorithm based on neighborhood search....
160
Authors: Fang Li, Yu Wang, Ying Chun Zhong, Zhi Tan
Chapter 16: Application of Information and Network Technology
Abstract:An optimization of multi-varieties and small-batch of production scheduling is proposed, which is embodied the utilization ratio of...
3177
Authors: Hai Yan Wang
Chapter 6: Production Management
Abstract:This paper presents a hybrid algorithm to address the flexible job-shop scheduling problem (FJSP). Based on Differential Evolution (DE), a...
502
Authors: Sun Xin Wang, Yan Li, Yan Rong Zhang
Chapter 15: Economics, Marketing and Engineering Management
Abstract:In this paper a hybrid algorithm named IPSO-VND is proposed and applied to solving the vehicle routing problem with simultaneous pickup and...
2326