A Problem in Bulk Service Scheduling

G. L. Nemhauser and P. L. Yu
Additional contact information
G. L. Nemhauser: Cornell University, Ithaca, New York
P. L. Yu: University of Rochester, Rochester, New York

Operations Research, 1972, vol. 20, issue 4, 813-819

Abstract: Given the operating costs, usage function, and planning horizon of a bulk service system, say a common-carrier transportation system, the objective is to determine the number and the starting times of the services so that the total profit is maximized. For such problems, this paper studies the existence and computability of optimal schedules. It shows that an ϵ-optimal schedule can be found by a discrete optimization on a sufficiently fine grid. It then makes more specific assumptions regarding the dependence of usage on the schedule and presents a dynamic-programming algorithm for the discrete optimization. Finally, an analytic solution is given for a simple case.

Date: 1972
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.20.4.813 (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:20:y:1972:i:4:p:813-819

Access Statistics for this article

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