Pages that link to "Item:Q4298947"
From MaRDI portal
The following pages link to An efficient integer programming model of the dynamic lot-sizing problem (Q4298947):
Displaying 11 items.
- An efficient procedure for dynamic lot-sizing model with demand time windows (Q868629) (← links)
- A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand (Q949496) (← links)
- The efficient computer implementation of a large-scale integer goal programming model (Q1079114) (← links)
- The synchronized and integrated two-level lot sizing and scheduling problem: evaluating the generalized mathematical model (Q1664892) (← links)
- Efficient reformulations for dynamic lot-sizing problems with product substitution (Q2379664) (← links)
- An Integer Programming Approach to the Apparel Sizing Problem (Q3740526) (← links)
- The Dynamic Lot-Sizing Problem with Startup and Reservation Costs (Q3767099) (← links)
- An improved algorithm for the dynamic lot-sizing problem with learning effect in setups (Q4287983) (← links)
- ارائه یک روش برنامه ریزی پویا کارا جهت بهینه سازی مسئله اندازه سفارش با محدودیت ظرفیت (Q4615735) (← links)
- The dynamic lot-sizing problem with variable unit costs (Q4851980) (← links)
- A cash‐constrained dynamic lot‐sizing problem with loss of goodwill and credit‐based loan (Q6092619) (← links)