research centers


Search results: Found 1

Listing 1 - 1 of 1
Sort by

Article
Exerct and Near Optimal Solution for Three Machine Flow Shop Scheduling

Authors: Tariq S. Abdul-Razaq --- Manal H. AL-Harby
Journal: Journal of College of Education مجلة كلية التربية ISSN: 18120380 Year: 2006 Issue: 3 Pages: 50-63
Publisher: Al-Mustansyriah University الجامعة المستنصرية

Loading...
Loading...
Abstract

In this paper we consider F3/ /C.o* problem in which theprocessing order is assumed to be the same on each machine, theresulting problem is called the permutation flow shop problem. Theobjective is to find a processing order on each machine such thatthe makespan C*o* , which is the completion time of the last job isminimized. This problem is NP-hard, hence the existence of apolynomial time algorithm for finding an optimal solution isunlikely. This complexity result leads us to use an enumerationsolution approach. In this paper rve proposc a branch and boundal-eorithm to solve this problem. Also we develop fastapproximation algorithms yielding near optimal solution. We

Keywords

Listing 1 - 1 of 1
Sort by
Narrow your search

Resource type

article (1)


Language

English (1)


Year
From To Submit

2006 (1)