Pages that link to "Item:Q613340"

The following pages link to Capacitated dynamic lot-sizing problem with delivery/production time windows (Q613340):

Displaying 16 items.

• Dynamic programming approximation algorithms for the capacitated lot-sizing problem (Q288224) (← links)
• Dual-mode production planning for manufacturing with emission constraints (Q322630) (← links)
• A polynomial algorithm for the production/ordering planning problem with limited storage (Q856668) (← links)
• A polynomial algorithm for a multi-item capacitated production planning problem (Q1316097) (← links)
• Sequential versus integrated optimization: production, location, inventory control, and distribution (Q1754314) (← links)
• A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows (Q1785294) (← links)
• Dynamic lot-sizing problem with demand time windows and container-based transportation cost (Q2465565) (← links)
• Lot-sizing with production and delivery time windows (Q2492704) (← links)
• A two-echelon inventory optimization model with demand time window considerations (Q2574100) (← links)
• Analysis of a dynamic lot-sizing problem with production capacity constraint (Q2816376) (← links)
• Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales (Q2997889) (← links)
• Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems (Q3196380) (← links)
• Capacitated Multi-Item Lot-Sizing Problems with Time Windows (Q3392030) (← links)
• ارائه یک روش برنامه ریزی پویا کارا جهت بهینه سازی مسئله اندازه سفارش با محدودیت ظرفیت (Q4615735) (← links)
• Dynamic lot‐sizing model with production time windows (Q5438269) (← links)
• Capacitated lot sizing with alternative routings and overtime decisions (Q5438625) (← links)