Sequencing to minimize the maximum renewal cumulative cost

DOI10.1016/0167-6377(92)90073-CzbMath0757.90038MaRDI QIDQ1200775

Li-Hui Tsai

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

sequencingindependent tasksstrongly NP-hardmaximum cumulative cost

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence ⋮ Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence

Cites Work

• Unnamed Item
• Sequencing to Minimize the Maximum Job Cost
• Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints

This page was built for publication: Sequencing to minimize the maximum renewal cumulative cost