The single (and multi) item profit maximizing capacitated lot-size (PCLSP) problem with fixed prices and no set-up

MaRDI QIDQ3585642zbMATH OpenFDO

Authors Kjetil K. Haugen, A. Olstad, Krystsina Bakhrankova, Erik van Eikenhorst

Publication date 20 August 2010

Full work available at URL https://eudml.org/doc/196386, http://www.kybernetika.cz/content/2010/3/415

zbMATH Keywords

heuristicslot-sizingdynamic pricingspecialized algorithm for LP's

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Microeconomic theory (price theory and economic markets) (91B24)

Recommendations

• The profit maximizing capacitated lot-size (PCLSP) problem
• Multi-item capacitated lot-sizing problems with setup times and pricing decisions
• An Algorithm for the Single-item Capacitated Lot-Sizing Problem with Concave Production and Holding Costs
• Algorithms for Capacitated, Multi-Item Lot-Sizing without Set-Ups
• An effective algorithm for the capacitated single item lot size problem

Cites work

• A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
• Deterministic Production Planning: Algorithms and Complexity
• Dynamic version of the economic lot size model
• Lot sizing and scheduling -- survey and extensions
• Price-Production Decisions with Deterministic Demand
• Solving large-scale profit maximization capacitated lot-size problems by heuristic methods
• The profit maximizing capacitated lot-size (PCLSP) problem

Cited in

(7)

• A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures
• The profit maximizing capacitated lot-size (PCLSP) problem
• scientific article; zbMATH DE number 3883923 (Why is no real title available?)
• Single item lot sizing problem considering loaning and capital constraint
• Large-scale joint price-inventory decision problems, under resource limitation and a discrete price set
• A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems
• Multi-item capacitated lot-sizing problems with setup times and pricing decisions

Describes a project that uses

Uses Software

• LOTSIZELIB

This page was built for publication: The single (and multi) item profit maximizing capacitated lot-size (PCLSP) problem with fixed prices and no set-up

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