A multi-period renewal equipment problem

DOI10.1016/J.EJOR.2011.12.011zbMath1244.90188OpenAlexW2036203506MaRDI QIDQ439598

Dritan Nace, Antoine Jouglet, Xiaokang Cao

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

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

Related Items (1)

A multi-period renewal equipment problem

Uses Software

• APL2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A multi-period renewal equipment problem
• Where are the hard knapsack problems?
• A dynamic programming approach to the multiple-choice multi-period knapsack problem and the recursive APL2 code
• Technical Note—The Multiperiod Knapsack Problem
• The multiple-choice multi-period knapsack problem
• Discrete-Variable Extremum Problems
• A Survey of the Generalized Assignment Problem and Its Applications

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