SINGLE-MACHINE SCHEDULING AND SELECTION TO MINIMIZE TOTAL FLOW TIME WITH MINIMUM NUMBER TARDY

Authors
KYPARISIS J DOULIGERIS C
Citation
J. Kyparisis et C. Douligeris, SINGLE-MACHINE SCHEDULING AND SELECTION TO MINIMIZE TOTAL FLOW TIME WITH MINIMUM NUMBER TARDY, The Journal of the Operational Research Society, 44(8), 1993, pp. 835-838
Citations number
6
Categorie Soggetti
Management,"Operatione Research & Management Science","Operatione Research & Management Science
Journal title
The Journal of the Operational Research Society → ACNP
ISSN journal
01605682
Volume
44
Issue
8
Year of publication
1993
Pages
835 - 838
Database
ISI
SICI code
0160-5682(1993)44:8<835:SSASTM>2.0.ZU;2-N
Abstract
Emmons considered the problem of sequencing N jobs on a single machine to minimize total flow time with the minimum number of tardy jobs. He proposed an effective branch-and-bound algorithm for this problem. In this paper, we show that Emmons' algorithm can be extended to a more difficult scheduling problem which includes an optimal selection of jo bs as well.