Pages that link to "Item:Q2890430"
From MaRDI portal
The following pages link to A general heuristic for production planning problems (Q2890430):
Displaying 24 items.
- Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines (Q490153) (← links)
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems (Q525062) (← links)
- Cost-based decision-making in middleware virtualization environments (Q531466) (← links)
- An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production (Q709140) (← links)
- A capacity scaling heuristic for the multicommodity capacitated network design problem (Q837097) (← links)
- A heuristic approach for big bucket multi-level production planning problems (Q958084) (← links)
- Approximate reasoning for production planning (Q1112714) (← links)
- An heuristic algorithm for the production line layout problem (Q1333509) (← links)
- Solving mixed integer programming production planning problems with setups by shadow price information. (Q1406717) (← links)
- MIP formulations and heuristics for two-level production-transportation problems (Q1761227) (← links)
- Heuristics for the economic production quantity problem under restrictions on production and maintenance time (Q1793704) (← links)
- A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
- A supervised learning-driven heuristic for solving the facility location and production planning problem (Q2140228) (← links)
- Heuristics with guaranteed performance bounds for a manufacturing system with product recovery (Q2255948) (← links)
- Worst case analysis of relax and fix heuristics for lot-sizing problems (Q2312339) (← links)
- MIPLIB 2003 (Q2466583) (← links)
- Note on ``Heuristics with guaranteed performance bounds for a manufacturing system with product recovery'' (Q2629699) (← links)
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
- Evolutionary algorithms for production planning problems with setup decisions (Q3154388) (← links)
- Heuristic decomposition approach to buffer operation planning in a production process (Q3202124) (← links)
- Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times (Q3458742) (← links)
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs (Q3598683) (← links)
- (Q4896281) (← links)
- MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem (Q5149549) (← links)