Pages that link to "Item:Q1577995"
From MaRDI portal
The following pages link to The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability (Q1577995):
Displaying 16 items.
- On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay (Q342563) (← links)
- Dynamic lot sizing for multiple products with a new joint replenishment model (Q418100) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem (Q1042113) (← links)
- Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach (Q2356184) (← links)
- Simultaneous lotsizing and scheduling problems: a classification and review of models (Q2362236) (← links)
- Single item lot-sizing problem for a warm/cold process with immediate lost sales (Q2467270) (← links)
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (Q2514881) (← links)
- Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources (Q2997890) (← links)
- Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem” (Q3116671) (← links)
- Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups (Q3163748) (← links)
- COMBINING PROCESS SELECTION AND LOT SIZING MODELS FOR PRODUCTION SCHEDULING OF ELECTROFUSED GRAINS (Q3392298) (← links)
- Some Extensions of the Discrete Lotsizing and Scheduling Problem (Q3982669) (← links)
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities (Q4286933) (← links)
- (Q5202818) (← links)
- Modeling industrial lot sizing problems: a review (Q5385468) (← links)
