Paper Title:
An Optimal Algorithm for a Special Flow Shop Problem with Infinite Buffer Capacity
  Abstract

In this paper, a two-machine flow shop problem with infinite buffer capacity is considered. Each of jobs is identical and 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. There is infinite buffer capacity between two machines. The problem is to determine the assignment of the flexible tasks to the machines for each job, with the objective of maximizing the makespan. We present an optimal algorithm for this 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
379-382
DOI
10.4028/www.scientific.net/AMM.101-102.379
Citation
Q. Wei, "An Optimal Algorithm for a Special Flow Shop Problem with Infinite Buffer Capacity", Applied Mechanics and Materials, Vols. 101-102, pp. 379-382, 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: Yun Qiang Yin, Feng Lian Yuan
Abstract:In many real life applications, jobs deteriorate at a certain rate while waiting to be processed. This paper introduces a new deterioration...
483
Authors: Parinya Kaweegitbundit
Chapter 3: Manufacturing Engineering
Abstract:This paper considers two stage hybrid flow shop with identical parallel machine and evaluate performance of common dispatching rules;...
1487
Authors: Dan Tang, Hong Ping Shu
Chapter 2: Management and Production Scheduling
Abstract:For the flow shop scheduling problem which aims to minimize makespan, this paper gives a new derivation about its mathematical definition,...
528
Authors: Li Li Liu
Chapter 3: Industry Technologies and Application
Abstract:This paper considers online scheduling with incompatible job families on single batch processing machine and parallel batchprocessing...
408
Authors: Shu Xia Zhang, Yu Zhong Zhang
Chapter 6: Information Technologies and Networks Engineering, Computational Methods and Management
Abstract:In this paper, we address the single machine scheduling problem with discretely compressible processing times, where processing any job with...
1020