Tight lower bounds by semidefinite relaxations for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs

DOI10.1007/978-3-642-29210-1_67MaRDI QIDQ5176341zbMATH OpenOpenAlexFDO

Authors C. Gicquel, Abdel Lisser

Publication date 3 March 2015

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29210-1_67

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Semidefinite programming (90C22) Production models (90B30)

Recommendations

• On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
• The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
• Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups
• An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
• New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups
• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• Some Extensions of the Discrete Lotsizing and Scheduling Problem
• A note on ``the capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• scientific article; zbMATH DE number 4197717
• On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs

Cited in

(1)

• On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times

This page was built for publication: Tight lower bounds by semidefinite relaxations for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176341)