Modeling and solving the constrained multi-items lot-sizing problem with time-varying setup cost
From MaRDI portal
Publication:2201355
DOI10.1016/J.CHAOS.2018.09.012zbMATH Open1442.90012OpenAlexW2893591804MaRDI QIDQ2201355FDOQ2201355
Shenghan Zhou, Yi-Yong Xiao, Xiaorong Zuo, Yang Cheng, Yuliang Zhou
Publication date: 29 September 2020
Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.chaos.2018.09.012
Recommendations
- An efficient approach for solving the lot-sizing problem with time-varying storage capacities
- Modelling multi-period set-up times in the proportional lot-sizing problem
- Analysis of a dynamic lot-sizing problem with production capacity constraint
- scientific article; zbMATH DE number 4179119
- An improved algorithm for the dynamic lot-sizing problem with learning effect in setups
Cites Work
- Computational complexity of uncapacitated multi-echelon production planning problems
- Dynamic programming approximation algorithms for the capacitated lot-sizing problem
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
- A multi-period ordering and clearance pricing model considering the competition between new and out-of-season products
- Differential evolution to solve the lot size problem in stochastic supply chain management systems
- Heuristic approach on dynamic lot-sizing model for durable products with end-of-use constraints
- Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems
- A two-storage multi-item inventory model with hybrid number and nested price discount via hybrid heuristic algorithm
- The economic order decision with continuous dynamic pricing and batch supply
- Modified Wavelet Full-Approximation Scheme for the Numerical Solution of Nonlinear Volterra integral and integro-differential Equations
- An iterative method for non-autonomous nonlocal reaction-diffusion equations
- NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract
- A Branch-and-Bound Algorithm for Computing Optimal Replacement Policies in K-Out-of-N Systems
- Analysis of Deterministic Control and Its Improvements for an Inventory Problem with Multiproduct Batch Differentiation
Cited In (2)
Uses Software
This page was built for publication: Modeling and solving the constrained multi-items lot-sizing problem with time-varying setup cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201355)