An Optimal Algorithm for a Special Flow Shop Problem with Infinite Buffer Capacity

Abstract:

Article Preview

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:

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:

$35.00

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

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