Simultaneous Resource Scheduling to Minimize Weighted Flow Times

Gregory Dobson and Uday S. Karmarkar
Additional contact information
Gregory Dobson: University of Rochester, Rochester, New York
Uday S. Karmarkar: University of Rochester, Rochester, New York

Operations Research, 1989, vol. 37, issue 4, 592-600

Abstract: Many scheduling problems in manufacturing and service firms involve tasks that require more than one resource to be used simultaneously to execute the task. Two formulations of this scheduling problem are given. We develop a Lagrangian relaxation for the problem that has an intuitive interpretation. The relaxation suggests heuristics and provides a lower bound on the optimal solution. Next a surrogate relaxation is developed that provides a second bound and a heuristic solution. An enumeration procedure to determine the optimal solution is described, and computational results on the effectiveness of the bounds and the heuristics are presented. The Lagrangian relaxation performs better on problems with a low degree of simultaneity, and the surrogate relaxation does better with a high degree of simultaneity.

Keywords: production/scheduling; sequencing; deterministic; multimachine: simultaneous resource scheduling; programming; integer; heuristic: simultaneous resource scheduling (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.37.4.592 (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:37:y:1989:i:4:p:592-600

Access Statistics for this article

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