New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups

DOI10.1016/J.EJOR.2021.12.032MaRDI QIDQ2140335zbMATH OpenOpenAlexWikidataFDO

Authors Younsoo Lee, Kyungsik Lee

Publication date 20 May 2022

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

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

zbMATH Keywords

approximate dynamic programming algorithminteger optimization modellot-sizing and scheduling problemproductionsequence-dependent setup

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Production models (90B30) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Rolling-horizon lot-sizing when set-up times are sequence-dependent
• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
• Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover
• Modeling lotsizing and scheduling problems with sequence dependent setups

Cites work

• A computational study of the general lot-sizing and scheduling model under demand uncertainty via robust and stochastic approaches
• A decomposition approach for the general lotsizing and scheduling problem for parallel production lines
• A note on ``The general lotsizing and scheduling problem
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• An approximate dynamic programming approach to multidimensional knapsack problems
• Approximate Dynamic Programming
• Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups
• Dynamic programming approximation algorithms for the capacitated lot-sizing problem
• Dynamic version of the economic lot size model
• General lot-sizing and scheduling for perishable food products
• scientific article; zbMATH DE number 3568353 (Why is no real title available?)
• LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
• MIP modelling of changeovers in production planning and scheduling problems
• Modeling lotsizing and scheduling problems with sequence dependent setups
• Modeling of period overlapping setup times
• Multilevel capacitated lotsizing complexity and LP-based heuristics
• Perspectives of approximate dynamic programming
• Production Planning by Mixed Integer Programming
• Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
• Simultaneous lotsizing and scheduling on parallel machines
• Simultaneous lotsizing and scheduling problems: a classification and review of models
• Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics
• Single machine multi-product capacitated lot sizing with sequence-dependent setups
• The capacitated lot-sizing problem with linked lot sizes
• The general lotsizing and scheduling problem

Cited in

(6)

• Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows
• The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
• Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover
• A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups
• Tight lower bounds by semidefinite relaxations for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs
• Enhancing industrial efficiency in an integrated lot sizing and scheduling problem

This page was built for publication: New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups

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