Pages that link to "Item:Q5472085"
From MaRDI portal
The following pages link to Production Planning by Mixed Integer Programming (Q5472085):
Displaying 50 items.
- The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity (Q256627) (← links)
- On reformulations for the one-warehouse multi-retailer problem (Q271926) (← links)
- Dynamic programming approximation algorithms for the capacitated lot-sizing problem (Q288224) (← links)
- Decomposition and mean-field approach to mixed integer optimal compensation problems (Q289132) (← links)
- A scatter search algorithm for the distributed permutation flowshop scheduling problem (Q297245) (← links)
- Optimization-based heuristics for underground mine scheduling (Q299816) (← links)
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- A polyhedral study of production ramping (Q304233) (← links)
- Resource loading with time windows (Q319369) (← links)
- A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations (Q320708) (← links)
- DASH: dynamic approach for switching heuristics (Q320816) (← links)
- A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry (Q322535) (← links)
- Fenced in? Stochastic and deterministic planning models in a time-fenced, rolling-horizon scheduling system (Q322628) (← links)
- A fix-and-optimize heuristic for the high school timetabling problem (Q337176) (← links)
- Multi-product valid inequalities for the discrete lot-sizing and scheduling problem (Q337324) (← links)
- Linear programming models for a stochastic dynamic capacitated lot sizing problem (Q337545) (← links)
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems (Q339582) (← links)
- Pricing for production and delivery flexibility in single-item lot-sizing (Q339714) (← links)
- Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies (Q342075) (← links)
- On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay (Q342563) (← links)
- Two-stage stochastic lot-sizing problem under cost uncertainty (Q383162) (← links)
- Relaxations for two-level multi-item lot-sizing problems (Q403668) (← links)
- The value function of an infinite-horizon single-item lot-sizing problem (Q433828) (← links)
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times (Q439552) (← links)
- A polyhedral study of lot-sizing with supplier selection (Q448963) (← links)
- Column generation for extended formulations (Q458128) (← links)
- Lot sizing with minimum order quantity (Q479047) (← links)
- Tailored Lagrangian relaxation for the open pit block sequencing problem (Q490234) (← links)
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems (Q525062) (← links)
- Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics (Q547140) (← links)
- Multiindex optimal production planning problems (Q612224) (← links)
- Multiple machine continuous setup lotsizing with sequence-dependent setups (Q616801) (← links)
- Multi-level single machine lot-sizing and scheduling with zero lead times (Q621969) (← links)
- A multi-objective production smoothing model with compressible operating times (Q638895) (← links)
- Projecting systems of linear inequalities with binary variables (Q646699) (← links)
- A note on the split rank of intersection cuts (Q647399) (← links)
- Polylithic modeling and solution approaches using algebraic modeling systems (Q691438) (← links)
- Mixing polyhedra with two non divisible coefficients (Q715089) (← links)
- Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
- A mixed integer programming model for solving real-time truck-to-door assignment and scheduling problem at cross docking warehouse (Q747012) (← links)
- An analysis of the integrated lot-sizing and cutting-stock problem formulation (Q821771) (← links)
- On the computational complexity of uncapacitated multi-plant lot-sizing problems (Q828705) (← links)
- Single item lot-sizing with non-decreasing capacities (Q847825) (← links)
- Lot-sizing on a tree (Q924877) (← links)
- Compact formulations as a union of polyhedra (Q927156) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- Lagrangean relaxation based heuristics for lot sizing with setup times (Q953424) (← links)
- A heuristic approach for big bucket multi-level production planning problems (Q958084) (← links)
- Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching (Q964867) (← links)
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution (Q967369) (← links)
