论文信息 - Minimizing the Total Flow Time of n Jobs on a Network

Minimizing the Total Flow Time of n Jobs on a Network

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. Handled by the Department of Scheduling, planning, and Control.

David Simchi-Levi | Oded Berman | D. Simchi-Levi | O. Berman

[1] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .

[3] Oded Berman,et al. Dynamic Repositioning of Indistinguishable Service Units on Transportation Networks , 1981 .

[4] David Simchi-Levi,et al. Minisum location of a traveling salesman , 1986, Networks.

[5] Teofilo F. Gonzalez,et al. P-Complete Approximation Problems , 1976, J. ACM.

[6] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[7] Pitu B. Mirchandani,et al. Location on networks : theory and algorithms , 1979 .

[8] E. Minieka. The delivery man problem on a tree network , 1990 .