bc -- prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems

Authors:
Gaetan Belvaux;Laurence A. Wolsey
Affiliations:
-;-
Venue:
Management Science
Year:
2000

Citing 0
Cited 21

Cutting planes in integer and mixed integer programming

Discrete Applied Mathematics
Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs

Computers and Operations Research
IBM Solves a Mixed-Integer Program to Optimize Its Semiconductor Supply Chain

Interfaces
Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation

Operations Research
Integrated production planning and preventive maintenance in deteriorating production systems

Information Sciences: an International Journal
Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight

Computers & Mathematics with Applications
Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution

Discrete Applied Mathematics
A new heuristic method for capacitated multi-level lotsizing problem with backlogging

CASE'09 Proceedings of the fifth annual IEEE international conference on Automation science and engineering
A polynomial time algorithm for the stochastic uncapacitated lot-sizing problem with backlogging

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Stochastic lot-sizing with backlogging: computational complexity analysis

Journal of Global Optimization
Kimberly-Clark Latin America Builds an Optimization-Based System for Machine Scheduling

Interfaces
Improved lower bounds for the capacitated lot sizing problem with setup times

Operations Research Letters
On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times

Journal of Global Optimization
A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands

Operations Research
Heuristics for the multi-item capacitated lot-sizing problem with lost sales

Computers and Operations Research
A computational analysis of lower bounds for big bucket production planning problems

Computational Optimization and Applications
A math-heuristic dantzig-wolfe algorithm for the capacitated lot sizing problem

LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging

Computers and Operations Research
A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders

Computers and Operations Research
Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms

Discrete Event Dynamic Systems
A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

bc -- prod is a prototype modelling and optimization system designed and able to tackle a wide variety of the discrete-time lot-sizing problems arising both in practice and in the literature. To usebc -- prod, the user needs to formulate his/her problem as a mixed integer program using XPRESS-MP'smp -- model, a standard mathematical programming modelling language, taking into account a reserved set of key words for specific lot-sizing objects, such as production variables, storage, and demand data, etc. The problem is then solved by the XPRESS-MP branch-and-bound system including lot-sizing specific preprocessing, cutting planes for different aspects of lot-sizing problems, plus general cutting planes, and a lot-sizing-specific primal heuristic. Results are presented for a wide variety of big bucket and small bucket models with set-up and start-up costs and times.