Paper Title:
The Optimal Algorithm of a Two-Stage Flow Shop Problem with Infinite Number of Jobs
  Abstract

In this paper, a two-machine two-stage flow shop with identical jobs is considered. Each of identical jobs has two tasks. The first task can be processed on either machine, called flexible task, while the second task must be processed on the second machine and can't be processed unless the first task has been processed. The problem is to determine the assignment of the flexible tasks to the machines for each job, with the objective of maximizing the throughput rate. This model is applied to the graphic programs processing which comprises data processing and graphics processing. We consider three cases regarding the capacity of the buffer between the machines with infinite number of jobs. We present optimal algorithm for each variant of the problem.

  Info
Periodical
Chapter
Chapter 2: Simulation and Engineering Optimization
Edited by
Di Zheng, Yiqiang Wang, Yi-Min Deng, Aibing Yu and Weihua Li
Pages
290-293
DOI
10.4028/www.scientific.net/AMM.101-102.290
Citation
Q. Wei, Y. Wu, "The Optimal Algorithm of a Two-Stage Flow Shop Problem with Infinite Number of Jobs", Applied Mechanics and Materials, Vols. 101-102, pp. 290-293, 2012
Online since
September 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: 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: Hai Feng Li, Ning Zhang
Chapter 1: Transportation & Service Science
Abstract:Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in...
21
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