Solving mixed integer programming production planning problems with setups by shadow price information.
type: Item
instance of: scholarly article
title: Solving mixed integer programming production planning problems with setups by shadow price information.
zbMATH Open document ID: 1042.90594
DOI: 10.1016/S0305-0548(98)00037-9
author: Yi-Feng Hung
author: Yi-Cheng Hu
published in: Computers \& Operations Research
publication date: 2003-09-07T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1975820
zbMATH Keywords: Capacitated lot sizing
zbMATH Keywords: production planning
zbMATH Keywords: mixed integer programming
describes a project that uses: CPLEX
MaRDI profile type: Publication
cites work: Strong Formulations for Multi-Item Capacitated Lot Sizing
cites work: Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: Integration of lotsizing and scheduling decisions in a job-shop
cites work: On practical resource allocation for production planning and scheduling with period overlapping setups
cites work: The Economic Lot Scheduling Problem (ELSP): Review and Extensions
cites work: Efficient Solution of the Single-item, Capacitated Lot-sizing Problem with Start-up and Reservation Costs
cites work: Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
cites work: Q3996398
cites work: An Efficient Algorithm for Multi-Item Scheduling
cites work: An optimal algorithm for the multi-item capacitated production planning problem
cites work: Multilevel capacitated lotsizing complexity and LP-based heuristics
cites work: Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
cites work: A Forward Algorithm for the Capacitated Lot Size Model with Stockouts
cites work: A user interactive heuristic procedure for solving the multiple product cycling problem
cites work: A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
cites work: Solving Mixed Integer Programming Problems Using Automatic Reformulation
full work available at URL: s0305-0548(98)00037-9
OpenAlex ID: W1984398163
description: scientific article; zbMATH DE number 1975820