Paper Title:
Hybrid Flowshop Scheduling with Finite Transportation Capacity
  Abstract

This paper studies a class of hybrid flowshop scheduling problem characterized by release time, transportation time and transportation capacity of one unit for each transporter. This problem is formulated as an integer programming model and a Lagrangian relaxation algorithm is designed to solve it. Testing results on problems of small to medium sizes show that the Lagrangian relaxation algorithm can obtain an acceptable near optimal schedule within a shorter CPU time.

  Info
Periodical
Edited by
Zhenyu Du and Bin Liu
Pages
574-578
DOI
10.4028/www.scientific.net/AMM.65.574
Citation
H. Xuan, "Hybrid Flowshop Scheduling with Finite Transportation Capacity", Applied Mechanics and Materials, Vol. 65, pp. 574-578, 2011
Online since
June 2011
Authors
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: Lian Xue, Xiao Xia Dai
Abstract:In this paper, the vehicle routing problem with fuzzy demands is considered, and a fuzzy chance constrained programming mathematical model is...
570
Authors: Wei Wei, Yi Xiong Feng, Jian Rong Tan, Ichiro Hagiwara
Abstract:Scheduling for the flexible job shop is very important in fields of production management. To solve the multi–objective optimization in...
546
Authors: Qing Hua Gu, Shi Gun Jing
Chapter 5: Materials Machining
Abstract:For vehicle routing optimization problem in the underground mine, a famous NP- Hard problem is put forward. This paper uses improved ant...
1293
Authors: Hui Juan Ma, Jing Wei
Chapter 10: Modern Logistics System Planning and Optimization
Abstract:With the rapid development of automobile industry, auto parts logistics emerged as an important part of promoting industrial development....
1463
Authors: Xiao Jian Han, Xiang Fang Ding, Chun Xiao
Chapter 3: Development Elecrtonics, Networks, Information Technology and Algorithms in Systems Applications
Abstract:How to get the most optimal solution of equipment layout in the aircraft cabin of the limited space is a completely NP problem. The problem...
659