A Dynamic Lot-Size Model with Make-or-Buy Decisions
From MaRDI portal
Recommendations
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Dynamic Lot Sizing with Batch Ordering and Truckload Discounts
- A new dynamic programming algorithm for the single item capacitated dynamic lot size model
- An efficient algorithm for the dynamic economic lot size problem
- The dynamic lot size model with quantity discount
Cited in
(15)- A comparison of several dynamic programming models of the made-to-order production situation
- A distribution multi-echelon lot-size model
- A dynamic programming algorithm for dynamic lot size models with piecewise linear costs
- An effective algorithm for the capacitated single item lot size problem
- Production allocation with dual provisioning
- Improved exact algorithms to economic lot-sizing with piecewise linear production costs
- Economic lot sizing with the consideration of random machine unavailability time
- Production lot-sizing with dynamic capacity adjustment
- A dynamic lot sizing model with production-or-outsourcing decision under minimum production quantities
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Polynomial-time solvability of dynamic lot size problems
- LINEAR PROGRAMMING MODELS WITH CHANGEABLE PARAMETERS — THEORETICAL ANALYSIS ON "TAKING LOSS AT THE ORDERING TIME AND MAKING PROFIT AT THE DELIVERY TIME"
- scientific article; zbMATH DE number 3961321 (Why is no real title available?)
- The Dynamic Lot Size Model With Stochastic Demands: A Decision Trorizon Study
- A multiple-criteria decision methodology for the make-or-buy problem
This page was built for publication: A Dynamic Lot-Size Model with Make-or-Buy Decisions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3818781)
