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

Authors:
Tao Wu;Kerem Akartunalı;Jie Song;Leyuan Shi
Affiliations:
Business Analytics and Optimization, Apollo Group, Phoenix, USA 85040;Department of Management Science, University of Strathclyde, Glasgow, UK G1 1QE;Department of Industrial Engineering and Management, Peking University, Beijing, China 100871;Department of Industrial Engineering and Management, Peking University, Beijing, China 100871 and Department of Industrial and Systems Engineering, University of Wisconsin-Madison, Madison, USA 53 ...
Venue:
Discrete Event Dynamic Systems
Year:
2013

Citing 19
Cited 2

Lot-size models with back-logging: strong reformulations and cutting planes

Mathematical Programming: Series A and B
Solving multi-item capacitated lot-sizing problems using variable redefinition

Operations Research
Solving multi-item lot-sizing problems using strong cutting planes

Management Science
A Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times

Management Science
A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover

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

Management Science
Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows

Operations Research
The Capacitated Lot-Sizing Problem with Linked Lot Sizes

Management Science
Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems

Operations Research
Using tabu search with ranking candidate list to solve production planning problems with setups

Computers and Industrial Engineering
The Single-Product Lot-Sizing Problem with Constant Parameters and Backlogging: Exact Results, a New Solution, and All Parameter Stability Regions

Operations Research
Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity

Mathematical Programming: Series A and B
Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs

Computers and Operations Research
Uncapacitated lot sizing with backlogging: the convex hull

Mathematical Programming: Series A and B
Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic

Computers and Operations Research
Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems

Operations Research
Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum

Computers and Operations Research
Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics

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

Journal of Global 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a mixed integer programming formulation for modeling the capacitated multi-level lot sizing problem with both backlogging and setup carryover. Based on the model formulation, a progressive time-oriented decomposition heuristic framework is then proposed, where improvement and construction heuristics are effectively combined, therefore efficiently avoiding the weaknesses associated with the one-time decisions made by other classical time-oriented decomposition algorithms. Computational results show that the proposed optimization framework provides competitive solutions within a reasonable time.