A heuristic approach for a multi-product capacitated lot-sizing problem with pricing
We address a multi-product capacitated lot-sizing problem with pricing. The objective is to maximise profit. The problem extends the multi-product capacitated lot-sizing problem (CLSP) found in the literature to include price as a decision variable, demand as a function of price, setup
time, and more general holding costs. We present a heuristic procedure that can be used to solve large problem instances quickly with good solution quality. The results of computational testing are presented.
Keywords: decomposition; economic lot-sizing; pricing; profit maximisation
Document Type: Research Article
Affiliations: 1: School of Industrial Engineering, Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, Valparaíso, Chile 2: Quality and Manufacturing Center, Tecnologico de Monterrey, Eugenio Garza Sada 2501, 64849 Monterrey, N.L., México 3: School of Computing, Informatics and Decision Systems Engineering, Arizona State University, PO Box 875906 Tempe, Arizona 85287, USA
Publication date: 15 February 2011
- Editorial Board
- Information for Authors
- Subscribe to this Title
- Ingenta Connect is not responsible for the content or availability of external websites
- Access Key
- Free content
- Partial Free content
- New content
- Open access content
- Partial Open access content
- Subscribed content
- Partial Subscribed content
- Free trial content