A modified variable neighborhood search algorithm for dynamic lot-sizing with supplier selection under varying delivery time quotation
From MaRDI portal
Publication:6551143
DOI10.1016/j.cor.2024.106532MaRDI QIDQ6551143
Ya Zhou, Jun Pei, Fangjun Zhu, Baoyu Liao, Panos M. Pardalos
Publication date: 6 June 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Nested general variable neighborhood search for the periodic maintenance problem
- The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation
- A new approach to solve the multi-product multi-period inventory lot sizing with supplier selection problem
- On the computational complexity of uncapacitated multi-plant lot-sizing problems
- Production and shipment lot sizing in a vendor--buyer supply chain with transportation cost
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- Variable neighbourhood search: methods and applications
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- Uncapacitated two-level lot-sizing
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
- The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
- Designing new heuristics for the capacitated lot sizing problem by genetic programming
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- Variable neighborhood search: basics and variants
- NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract
- Optimizing inventory decisions in a two-level supply chain with order quantity constraints
- Robust optimization approaches for purchase planning with supplier selection under lead time uncertainty
- Delivery time quotation and pricing in two-stage supply chains: centralized decision-making with global and local managerial approaches
- A new local search for continuous location problems
- A mathematical programming model for integrating production and procurement transport decisions
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- Variable neighborhood search and local branching
- Single item lot sizing problems
- Lead time considerations for the multi-level capacitated lot-sizing problem
- Fair and profitable: how pricing and lead-time quotation policies can help
- A multi-product dynamic supply chain inventory model with supplier selection, joint replenishment, and transportation cost
- Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem
- Dynamic version of the economic lot size model
- Promised Delivery Time and Capacity Games in Time-Based Competition
- A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
- Computational Complexity of the Capacitated Lot Size Problem
- Inventory Control and Delivery Time Quotation for Assembly Supply Chains
- Variable neighborhood search: the power of change and simplicity
This page was built for publication: A modified variable neighborhood search algorithm for dynamic lot-sizing with supplier selection under varying delivery time quotation