Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups

DOI10.1016/j.ejor.2023.03.003OpenAlexW4323669745MaRDI QIDQ6113320

Younsoo Lee, Kyungsik Lee

Publication date: 11 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2023.03.003

zbMATH Keywords

productionvalid inequalityextended formulationsequence-dependent setuplot-sizing and scheduling problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Modeling lotsizing and scheduling problems with sequence dependent setups
• Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
• New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem
• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• Capacitated lot-sizing with extensions: a review
• Uncapacitated lot sizing with backlogging: the convex hull
• A result on projection for the vehicle routing problem
• Total unimodularity and combinatorial theorems
• An analytical comparison of different formulations of the travelling salesman problem
• The general lotsizing and scheduling problem
• Multistars, partial multistars and the capacitated vehicle routing problem
• On the polyhedral structure of a multi-item production planning model with setup times
• A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case
• Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
• Facets and algorithms for capacitated lot sizing
• A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production
• Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup
• Pricing, relaxing and fixing under lot sizing and scheduling
• Simultaneous lotsizing and scheduling problems: a classification and review of models
• Projection results for vehicle routing
• The Vehicle Routing Problem
• Integer Programming Formulation of Traveling Salesman Problems
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Computational Complexity of the Capacitated Lot Size Problem
• Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size
• Single machine multi-product capacitated lot sizing with sequence-dependent setups
• Production Planning by Mixed Integer Programming

This page was built for publication: Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups