A multi-period renewal equipment problem

DOI10.1016/J.EJOR.2011.12.011MaRDI QIDQ439598zbMATH OpenOpenAlexFDO

Authors Xiaokang Cao, Antoine Jouglet, Dritan Nace

Publication date 16 August 2012

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2011.12.011

zbMATH Keywords

complexityschedulingknapsackmulti-periodheuristic methods

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• The multiple-choice multi-period knapsack problem
• An exact algorithm for the budget-constrained multiple knapsack problem
• scientific article; zbMATH DE number 3906236
• scientific article; zbMATH DE number 1996460
• Mathematical models and decomposition methods for the multiple knapsack problem

Cites work

• scientific article; zbMATH DE number 3168165 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Survey of the Generalized Assignment Problem and Its Applications
• A dynamic programming approach to the multiple-choice multi-period, knapsack problem and the recursive APL2 code
• A multi-period renewal equipment problem
• Discrete-variable extremum problems
• Technical Note—The Multiperiod Knapsack Problem
• The generalized assignment problem
• The multiple-choice multi-period knapsack problem
• Where are the hard knapsack problems?

Cited in

(2)

• Solution of the Multi-Asset Finite Horizon Investment Renewal Problem
• A multi-period renewal equipment problem

Describes a project that uses

Uses Software

• APL2

This page was built for publication: A multi-period renewal equipment problem

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