Minimizing Variation of Flow Time in Single Machine Systems

John J. Kanet
Additional contact information
John J. Kanet: University of Georgia

Management Science, 1981, vol. 27, issue 12, 1453-1459

Abstract: This paper addresses the problem of n jobs to be scheduled on a single machine in such a way that flow time variation is minimized. When the measure of variation is total absolute difference of completion times (TADC) the problem is shown to be quite simple. Sufficient conditions are shown for minimal TADC and a simple method for generating an optimal solution is provided. When the measure of variation is variance of flow time the problem is much more difficult. For this case a heuristic method for scheduling is proposed. The heuristic is simple and provides solutions which compare favorably with others found in the literature.

Keywords: production/scheduling: flow shop; programming: heuristic (search for similar items in EconPapers)
Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (35)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.27.12.1453 (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:ormnsc:v:27:y:1981:i:12:p:1453-1459

Access Statistics for this article

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