Pages that link to "Item:Q811334"
From MaRDI portal
The following pages link to Multilevel capacitated lotsizing complexity and LP-based heuristics (Q811334):
Displaying 50 items.
- A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem (Q337043) (← links)
- Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items (Q342353) (← links)
- Production scheduling in a market-driven foundry: a mathematical programming approach versus a project scheduling metaheuristic algorithm (Q400054) (← links)
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times (Q439552) (← links)
- Multi-level multi-item lot size planning with limited resources and general manufacturing structure. (Q684381) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- Capacitated lot-sizing with extensions: a review (Q926571) (← links)
- A coupling cutting stock-lot sizing problem in the paper industry (Q940851) (← links)
- Lagrangean relaxation based heuristics for lot sizing with setup times (Q953424) (← links)
- Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight (Q971702) (← links)
- Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times (Q991842) (← links)
- A hybrid optimization approach for multi-level capacitated lot-sizing problems (Q1042516) (← links)
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem (Q1044091) (← links)
- A dynamic lot sizing model with exponential machine breakdowns (Q1278130) (← links)
- Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing (Q1278343) (← links)
- Lot sizing and scheduling -- survey and extensions (Q1278770) (← links)
- Aggregate scheduling and network solving of multi-stage and multi-item manufacturing systems (Q1291703) (← links)
- Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions (Q1303540) (← links)
- A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures (Q1331603) (← links)
- Multi-item capacitated lot-sizing by a cross decomposition based algorithm (Q1339158) (← links)
- A heuristic method for lot-sizing in multi-stage systems (Q1370714) (← links)
- Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing (Q1374386) (← links)
- The general lotsizing and scheduling problem (Q1374405) (← links)
- Solving mixed integer programming production planning problems with setups by shadow price information. (Q1406717) (← links)
- Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacitated lot sizing problem (Q1571038) (← links)
- A lot-sizing problem in an automated foundry (Q1598716) (← links)
- Heuristic genetic algorithms for general capacitated lot-sizing problems (Q1609180) (← links)
- Minimizing average project team size given multi-skilled workers with heterogeneous skill levels (Q1651635) (← links)
- Combined cutting stock and lot-sizing problem with pattern setup (Q1652627) (← links)
- The synchronized and integrated two-level lot sizing and scheduling problem: evaluating the generalized mathematical model (Q1664892) (← links)
- Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs (Q1781573) (← links)
- Workforce planning in a lotsizing mail processing problem (Q1781576) (← links)
- Integrated production/distribution planning in supply chains: An invited review (Q1809796) (← links)
- Multiple level production planning in rolling horizon assembly environments (Q1809820) (← links)
- Lot sizing in capacitated production planning and control systems (Q1891872) (← links)
- The application of valid inequalities to the multi-stage lot-sizing problem (Q1894735) (← links)
- Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows (Q1996750) (← links)
- New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups (Q2140335) (← links)
- Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup (Q2239950) (← links)
- Worst case analysis of relax and fix heuristics for lot-sizing problems (Q2312339) (← links)
- Statistical search methods for lotsizing problems (Q2367017) (← links)
- Solving large-scale profit maximization capacitated lot-size problems by heuristic methods (Q2369969) (← links)
- Efficient reformulations for dynamic lot-sizing problems with product substitution (Q2379664) (← links)
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (Q2379665) (← links)
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines (Q2433465) (← links)
- Heuristic algorithms for dynamic capacitated lotsizing for production flow networks with setup times (Q2477097) (← links)
- Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company (Q2480208) (← links)
- Comparative approaches to equipment scheduling in high volume factories (Q2565775) (← links)
- Single item lot sizing problems (Q2566041) (← links)
- Lead time considerations for the multi-level capacitated lot-sizing problem (Q2629719) (← links)
