Sequencing to minimize the maximum renewal cumulative cost

DOI10.1016/0167-6377(92)90073-CMaRDI QIDQ1200775zbMATH OpenFDO

Authors Li-Hui Tsai

Publication date 16 January 1993

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

Full work available at URL https://doi.org/10.1016/0167-6377(92)90073-C

zbMATH Keywords

independent tasksmaximum cumulative costsequencingstrongly NP-hard

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4033468
• Optimal timing of a sequence of tasks with general completion costs
• scientific article; zbMATH DE number 686970
• Single facility sequencing with variable processing times and costs
• Minimizing the earliness and tardiness cost of a sequence of tasks on a single machine.

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints
• Sequencing to Minimize the Maximum Job Cost

Cited in

(3)

• 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
• On minimizing wiggle in stacked area charts

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200775)