Pages that link to "Item:Q5630826"
From MaRDI portal
The following pages link to An Efficient Algorithm for Multi-Item Scheduling (Q5630826):
Displaying 50 items.
- Hybrid methods for lot sizing on parallel machines (Q342050) (← links)
- Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines (Q490153) (← links)
- The discrete lot-sizing and scheduling problem (Q582202) (← links)
- A Benders decomposition based heuristic for the hierarchical production planning problem (Q584066) (← 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)
- An implementation of Lagrangian decomposition in solving a multi-item production scheduling problem with changeover cost and restrictions (Q915629) (← links)
- Analysis of relaxations for the multi-item capacitated lot-sizing problem (Q922259) (← links)
- Set partitioning and column generation heuristics for capacitated dynamic lotsizing (Q922926) (← links)
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem (Q1044091) (← links)
- Vehicle routing via column generation (Q1058983) (← links)
- A heuristic for multiple choice programming (Q1089261) (← links)
- On upper bounds of sequential stochastic production planning problems (Q1106717) (← links)
- A simulation study of hierarchical production-inventory control (Q1143303) (← links)
- Primal-dual approach to the single level capacitated lot-sizing problem (Q1178641) (← links)
- Capacitated lot-sizing and scheduling by Lagrangean relaxation (Q1198326) (← links)
- Comparisons of practical hierarchical control methods for interconnected dynamical systems (Q1222610) (← links)
- An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem (Q1260745) (← links)
- Aggregate scheduling and network solving of multi-stage and multi-item manufacturing systems (Q1291703) (← links)
- The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming (Q1317050) (← links)
- A new heuristic approach for the multi-item dynamic lot sizing problem (Q1331607) (← links)
- CMIT, capacitated multi-level implosion tool (Q1333500) (← links)
- The general lotsizing and scheduling problem (Q1374405) (← links)
- Solving mixed integer programming production planning problems with setups by shadow price information. (Q1406717) (← links)
- The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability (Q1577995) (← links)
- Simultaneous lotsizing and scheduling considering secondary resources: a general model, literature review and classification (Q1733088) (← links)
- An experimental analysis of solution performance in a resource sharing and scheduling problem (Q1776960) (← links)
- A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over (Q1782152) (← links)
- Schumann, a modeling framework for supply chain management under uncertainty (Q1806755) (← links)
- Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Aggregate production planning for process industries under oligopolistic competition (Q2253384) (← links)
- Simultaneous lotsizing and scheduling problems: a classification and review of models (Q2362236) (← links)
- Integrated versus hierarchical approach to aggregate production planning and master production scheduling (Q2362243) (← links)
- Scheduling the replenishment of just-in-time supermarkets in assembly plants (Q2362251) (← 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)
- Aggregate production planning for a continuous reconfigurable manufacturing process (Q2485173) (← links)
- An approach for integrated scheduling and lot-sizing (Q2490158) (← links)
- A note on modeling multiple choice requirements for simple mixed integer programming solvers (Q2563892) (← links)
- Dantzig-Wolfe decomposition for the facility location and production planning problem (Q2664417) (← links)
- A cyclical scheduling heuristic for lot sizing with capacity constraints (Q3330960) (← links)
- An ideal column algorithm for integer programs with special ordered sets of variables (Q3666590) (← links)
- Disaggregation to a rolling horizon master production schedule with minimum batch-size production restrictions (Q4230161) (← links)
- A framework for modelling setup carryover in the capacitated lot sizing problem (Q4399025) (← links)
- An integrated model for inventory and production planning in a two-stage hybrid production system (Q4706329) (← links)
- Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines (Q5131723) (← links)
- Modeling industrial lot sizing problems: a review (Q5385468) (← links)
- Robust optimization applied to uncertain production loading problems with import quota limits under the global supply chain management environment (Q5478835) (← links)
- Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests (Q6080592) (← links)
