Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time

Lee A. Herrbach and Joseph Y.-T. Leung
Additional contact information
Lee A. Herrbach: AT&T Bell Laboratories, Naperville, Illinois
Joseph Y.-T. Leung: University of Texas at Dallas, Richardson, Texas

Operations Research, 1990, vol. 38, issue 3, 487-494

Abstract: We give an O ( n log n ) time algorithm to preemptively schedule n equal-length jobs with release times on two identical, parallel machines so as to minimize the mean flow time. The complexity of the general problem of minimizing the mean weighted flow time is also reviewed, both for nonpreemptive and preemptive scheduling.

Keywords: production/scheduling: deterministic job shop scheduling; production/scheduling line balancing: mean weighted flow time (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.3.487 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:38:y:1990:i:3:p:487-494

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().