Back to Search Start Over

Minimizing the Total Flow Time of n Jobs on a Network.

Authors :
Simchi-Levi, David
Berman, Oded
Source :
IIE Transactions; Sep91, Vol. 23 Issue 3, p236-244, 9p, 11 Diagrams, 2 Charts
Publication Year :
1991

Abstract

This paper addresses the problem of determining a sequence for processing jobs on a machine, with sequence dependent setup times, such that the total flow time is minimized. The paper includes a branch and bound algorithm to find the optimal tour sequence. [ABSTRACT FROM AUTHOR]

Subjects

Subjects :
ALGORITHMS
ALGEBRA
FOUNDATIONS of arithmetic
MATHEMATICS

Details

Language :
English
ISSN :
0740817X
Volume :
23
Issue :
3
Database :
Complementary Index
Journal :
IIE Transactions
Publication Type :
Academic Journal
Accession number :
14967980
Full Text :
https://doi.org/10.1080/07408179108963858
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details