Sequencing to minimize the maximum renewal cumulative cost

Authors:
Tsai Li-Hui
Affiliations:
Department of Decision and Information Sciences, University of Florida, Gainesville, FL 32611-2017, USA
Venue:
Operations Research Letters
Year:
1992

Citing 1
Cited 1

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the problem of sequencing n independent tasks, each of which is associated with a cost. The objective is to minimize the maximum cumulative cost incurred during the execution of the set of tasks. After a task has been executed, the cumulative cost is equal to the larger of zero and the previously cumulated cost plus the cost of the task. This problem is strongly NP-hard. An algorithm is developed that solves this problem in O(log n) time when two types of tasks are involved.