Pages that link to "Item:Q3890384"
From MaRDI portal
The following pages link to Deterministic Production Planning: Algorithms and Complexity (Q3890384):
Displaying 50 items.
- Dynamic programming approximation algorithms for the capacitated lot-sizing problem (Q288224) (← links)
- Integrating deterioration and lifetime constraints in production and supply chain planning: a survey (Q296854) (← links)
- Scheduling with few changes (Q299829) (← links)
- The economic lot-sizing problem with perishable items and consumption order preference (Q319481) (← links)
- Dual-mode production planning for manufacturing with emission constraints (Q322630) (← links)
- A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times (Q342038) (← links)
- Integrated cost optimization in a two-stage, automotive supply chain (Q342249) (← links)
- Planning for demand failure: a dynamic lot size model for clinical trial supply chains (Q418060) (← links)
- Capacitated lot sizing problems with inventory bounds (Q492789) (← links)
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems (Q525062) (← links)
- Analysis of the maximum level policy in a production-distribution system (Q547123) (← links)
- A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints (Q583078) (← links)
- Capacitated dynamic lot-sizing problem with delivery/production time windows (Q613340) (← links)
- A robust lot sizing problem with ill-known demands (Q690887) (← links)
- Inventory replenishment model: lot sizing versus just-in-time delivery. (Q703285) (← links)
- Integrated market selection and production planning: complexity and solution approaches (Q715060) (← links)
- Integrated inventory routing and freight consolidation for perishable goods (Q724138) (← links)
- Warehouse location with production, inventory, and distribution decisions: a case study in the lube oil industry (Q742505) (← links)
- Capacity expansion planning for a single facility product line (Q795708) (← links)
- Multilevel capacitated lotsizing complexity and LP-based heuristics (Q811334) (← links)
- Cost-based filtering techniques for stochastic inventory control under service level constraints (Q842783) (← links)
- Single item lot-sizing with non-decreasing capacities (Q847825) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- Analysis of relaxations for the multi-item capacitated lot-sizing problem (Q922259) (← links)
- Set partitioning and column generation heuristics for capacitated dynamic lotsizing (Q922926) (← links)
- An algorithm for single-item economic lot-sizing problem with general inventory cost, non-decreasing capacity, and non-increasing setup and production cost (Q943784) (← links)
- A heuristic approach for big bucket multi-level production planning problems (Q958084) (← links)
- Multi-item lot-sizing with joint set-up costs (Q1013968) (← links)
- A global chance-constraint for stochastic inventory systems under service level constraints (Q1020492) (← links)
- Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs (Q1026766) (← links)
- Models for the schedule optimization problem at a public transit terminal (Q1027998) (← links)
- Capacitated dynamic lot sizing problems in closed-loop supply chain (Q1042061) (← links)
- A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure (Q1042524) (← links)
- A simple heuristic for the multi-item single level capacitated lotsizing problem (Q1079109) (← links)
- A dynamic production scheduling model with lost-sales or backlogging (Q1092803) (← links)
- Computational complexity of uncapacitated multi-echelon production planning problems (Q1121774) (← links)
- Production planning with time-dependent capacity bounds (Q1159564) (← links)
- A dual algorithm for the economic lot-sizing problem (Q1175307) (← links)
- Primal-dual approach to the single level capacitated lot-sizing problem (Q1178641) (← links)
- Capacitated lot-sizing and scheduling by Lagrangean relaxation (Q1198326) (← links)
- Comparative study of dynamic lot sizing heuristics with backlogging (Q1200833) (← links)
- An efficient algorithm for the capacitated single item dynamic lot size problem (Q1262197) (← links)
- Lot sizing and scheduling -- survey and extensions (Q1278770) (← links)
- A new dynamic programming algorithm for the single item capacitated dynamic lot size model (Q1318270) (← links)
- A dynamic programming algorithm for dynamic lot size models with piecewise linear costs (Q1327429) (← links)
- A new heuristic approach for the multi-item dynamic lot sizing problem (Q1331607) (← links)
- A linear description of the discrete lot-sizing and scheduling problem (Q1331608) (← links)
- An effective algorithm for the capacitated single item lot size problem (Q1331619) (← links)
- Multi-item capacitated lot-sizing by a cross decomposition based algorithm (Q1339158) (← links)
- A heuristic method for lot-sizing in multi-stage systems (Q1370714) (← links)
