The profit maximizing capacitated lot-size (PCLSP) problem

DOI10.1016/j.ejor.2005.08.001zbMath1137.90619OpenAlexW2011181533MaRDI QIDQ2432891

Bård I. Pettersen, Kjetil K. Haugen, Asmund Olstad

Publication date: 25 October 2006

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

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

zbMATH Keywords

heuristicsinteger programmingdynamic pricinglot-sizing

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (12)

Solving large-scale profit maximization capacitated lot-size problems by heuristic methods ⋮ A profit-maximizing economic lot scheduling problem with price optimization ⋮ Large-scale joint price-inventory decision problems, under resource limitation and a discrete price set ⋮ Integrated markdown pricing and aggregate production planning in a two echelon supply chain: a hybrid fuzzy multiple objective approach ⋮ Unnamed Item ⋮ Loss of customer goodwill in the uncapacitated lot-sizing problem ⋮ Design of mathematical models for the integration of purchase and production lot-sizing and scheduling problems under demand uncertainty ⋮ A dynamic marketing-operations interface model of new product updates ⋮ Optimal selling price and lotsize with time varying deterioration and partial backlogging ⋮ Profit maximization in simultaneous lot-sizing and scheduling problem ⋮ Joint optimization of dynamic pricing and lot-sizing decisions with nonlinear demands: theoretical and computational analysis ⋮ Unnamed Item

Uses Software

• LOQO
• LOTSIZELIB

Cites Work

• Lot sizing and scheduling -- survey and extensions
• Dynamic Version of the Economic Lot Size Model
• Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
• Dynamic Pricing in the Presence of Inventory Considerations: Research Overview, Current Practices, and Future Directions
• Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs
• bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
• Computational Complexity of the Capacitated Lot Size Problem
• A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
• An effective heuristic for the CLSP with set-up times
• Price-Production Decisions with Deterministic Demand
• The uncapacitated lot-sizing problem with sales and safety stocks

This page was built for publication: The profit maximizing capacitated lot-size (PCLSP) problem