Constraint programming for computing non-stationary \((R, S)\) inventory policies (Q2482781): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: XPRESS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2006.11.048 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2116797411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Constraint Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Heuristic for Computing Nonstationary (s, S) Policies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction problems: Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inventory management problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inventory models with minimal service level constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nervousness in inventory management: Comparison of basic control rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power Approximation for Computing (<i>s</i>, <i>S</i>) Inventory Policies / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Computing Optimal (<i>s</i>, <i>S</i>) Policies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating the Effectiveness of a New Method for Computing Approximately Optimal (<i>s</i>, <i>S</i>) Inventory Policies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning stability under \((s,S)\) inventory control rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nervousness in inventory control: Analytical results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5602035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling and computing \((R^{n}, S^{n})\) policies for inventory systems with non-stationary stochastic demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Optimal (<i>s, S</i>) Inventory Policies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:11, 27 June 2024

scientific article
Language Label Description Also known as
English
Constraint programming for computing non-stationary \((R, S)\) inventory policies
scientific article

    Statements

    Constraint programming for computing non-stationary \((R, S)\) inventory policies (English)
    0 references
    0 references
    0 references
    24 April 2008
    0 references
    inventory control
    0 references
    integer programming
    0 references
    constraint programming
    0 references
    demand uncertainty
    0 references
    0 references
    0 references

    Identifiers