Pages that link to "Item:Q1374379"

The following pages link to On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs (Q1374379):

Displaying 24 items.

• Multi-product valid inequalities for the discrete lot-sizing and scheduling problem (Q337324) (← links)
• On discrete lot-sizing and scheduling on identical parallel machines (Q691392) (← links)
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
• On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times (Q1002081) (← links)
• Discrete lot sizing and scheduling using product decomposition into attributes (Q1010282) (← links)
• Scheduling multiprocessor tasks -- An overview (Q1278297) (← links)
• On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs (Q1374379) (← links)
• Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
• Polyhedra for lot-sizing with Wagner-Whitin costs (Q1804648) (← links)
• Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs (Q1807930) (← links)
• Simultaneous lotsizing and scheduling problems: a classification and review of models (Q2362236) (← links)
• Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company (Q2480208) (← links)
• An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (Q2514881) (← links)
• Discrete multi-module capacitated lot-sizing problems with multiple items (Q2670496) (← links)
• On the Wagner-Whitin lot-sizing polyhedron. (Q2757684) (← links)
• A maritime inventory routing problem: discrete time formulations and valid inequalities (Q2811316) (← links)
• LS-LIB: A Library of Tools for Solving Production Planning Problems (Q2971615) (← links)
• Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources (Q2997890) (← links)
• (Q3028681) (← links)
• Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem” (Q3116671) (← links)
• COMBINING PROCESS SELECTION AND LOT SIZING MODELS FOR PRODUCTION SCHEDULING OF ELECTROFUSED GRAINS (Q3392298) (← links)
• Tight lower bounds by semidefinite relaxations for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs (Q5176341) (← links)
• (Q5202818) (← links)
• Discrepancies in solutions between traditional and net present value formulations of finite horizon, discrete-time economic lot size problems (Q5451188) (← links)