A multi-period renewal equipment problem
DOI10.1016/J.EJOR.2011.12.011zbMATH Open1244.90188OpenAlexW2036203506MaRDI QIDQ439598FDOQ439598
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
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The generalized assignment problem
- Title not available (Why is that?)
- Where are the hard knapsack problems?
- A Survey of the Generalized Assignment Problem and Its Applications
- Discrete-variable extremum problems
- A dynamic programming approach to the multiple-choice multi-period, knapsack problem and the recursive APL2 code
- Technical Note—The Multiperiod Knapsack Problem
- A multi-period renewal equipment problem
- The multiple-choice multi-period knapsack problem
Cited In (2)
Uses Software
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)