On the polyhedral structure of a multi���item production planning model with setup times (original) (raw)

A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case

George Nemhauser

View PDFchevron_right

A polyhedral approach to a production planning problem

Miguel Fragoso Constantino

Annals of Operations Research, 2000

View PDFchevron_right

On the capacitated lot-sizing and continuous 0–1 knapsack polyhedra

George Nemhauser

European Journal of Operational Research, 2000

View PDFchevron_right

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

Simge Kucukyavuz

Operations Research, 2005

View PDFchevron_right

The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs

Ridha Erromdhani

Computers & Operations Research, 2009

View PDFchevron_right

Facets and algorithms for capacitated lot sizing

Janny Leung

Mathematical Programming, 1989

View PDFchevron_right

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

Joseph Geunes

Journal of Global Optimization, 2012

View PDFchevron_right

On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times

Haldun Sural

Journal of the Operational Research Society, 2006

View PDFchevron_right

Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs

Yves Pochet

European Journal of Operational Research, 2009

View PDFchevron_right

Polyhedral Study of Mixed Integer Sets Arising from Inventory Problems

Mahdi Doostmohammadi

2014

View PDFchevron_right

Exact methods for single-item capacitated lot sizing problem with alternative machines and piece-wise linear production costs

Bernard Penz

International Journal of Production Economics, 2009

View PDFchevron_right

An Efficient MIP Model for the Capacitated Lot-sizing and Scheduling Problem with Sequence-dependent Setups," A. Kovacs, K. Brown and S. A. Tarim, International Journal of Production Economics, 118, pp.282-291, 2009

S. Armagan Tarim

View PDFchevron_right

A cutting plane approach to capacitated lot-sizing with start-up costs

Miguel Fragoso Constantino

Mathematical Programming, 1996

View PDFchevron_right

Multi-item lot-sizing with joint set-up costs

Michal Tzur

Mathematical Programming, 2009

View PDFchevron_right

A polyhedral study of the single-item lot-sizing problem with continuous start-up costs

Javier Marenco

Electronic Notes in Discrete Mathematics, 2011

View PDFchevron_right

An efficient MIP model for the capacitated lot-sizing and scheduling problem with sequence-dependent setups

S. Armagan Tarim

International Journal of Production Economics, 2009

View PDFchevron_right

Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem

Hark-Chin Hwang

Operations Research, 2013

View PDFchevron_right

Lagrangian relaxation and bounded variable linear programs to solve a two level capacitated lot sizing problem

Mayank Verma

2011

View PDFchevron_right

The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity

Javier Marenco

Annals of Operations Research, 2015

View PDFchevron_right

© 2013 INFORMS Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem

Hark-Chin Hwang

2013

View PDFchevron_right

Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities

Retsef Levi

Lecture Notes in Computer Science, 2007

View PDFchevron_right

A global constraint for the capacitated single-item lot-sizing problem

Bernard Penz

ArXiv, 2019

View PDFchevron_right

A study of the lot-sizing polytope

Juan Carlos Muñoz

Mathematical Programming, 2004

View PDFchevron_right

Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities

Retsef Levi

Mathematics of Operations Research, 2008

View PDFchevron_right

Uncapacitated lot sizing with backlogging: the convex hull

Simge Kucukyavuz

Mathematical Programming, 2009

View PDFchevron_right

Exact methods for the single-item multi-plant capacitated lot sizing problem coupled with transportation

Bernard Penz

View PDFchevron_right

Yet another note on “An efficient zero-one formulation of the multilevel lot-sizing problem”

Marco Lübbecke

1998

View PDFchevron_right

On the solution of large-scale mixed integer programming scheduling models

SARA MANUELA GARZON VELEZ

Chemical Engineering Science, 2015

View PDFchevron_right

A New Branching Rule to Solve the Capacitated Lot Sizing and Scheduling Problem with Sequence Dependent Setups

Willy Oliveira

TEMA (São Carlos), 2018

View PDFchevron_right