Pages that link to "Item:Q582202"
From MaRDI portal
The following pages link to The discrete lot-sizing and scheduling problem (Q582202):
Displaying 50 items.
- A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem (Q319274) (← links)
- A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem (Q337043) (← links)
- Multi-product valid inequalities for the discrete lot-sizing and scheduling problem (Q337324) (← links)
- On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay (Q342563) (← links)
- Multi-level multi-item lot size planning with limited resources and general manufacturing structure. (Q684381) (← links)
- Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory (Q747754) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- Buffer sizing in multi-product multi-reactor batch processes: Impact of allocation and campaign sizing policies (Q858456) (← links)
- On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times (Q1002081) (← links)
- Discrete lot sizing and scheduling using product decomposition into attributes (Q1010282) (← links)
- Solution approaches for the soft drink integrated production lot sizing and scheduling problem (Q1027560) (← links)
- Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants (Q1040968) (← links)
- Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem (Q1042113) (← links)
- A comparison of two lot sizing-sequencing heuristics for the process industry (Q1198320) (← links)
- Multi-level, single-machine lot sizing and scheduling (with initial inventory) (Q1266652) (← links)
- Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows (Q1278129) (← links)
- Lot sizing and scheduling -- survey and extensions (Q1278770) (← links)
- Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions (Q1303540) (← links)
- The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming (Q1317050) (← links)
- The stochastic dynamic product cycling problem (Q1330541) (← links)
- A linear description of the discrete lot-sizing and scheduling problem (Q1331608) (← links)
- The discrete lot-sizing and scheduling problem with sequence-dependent setup costs (Q1331615) (← links)
- The general lotsizing and scheduling problem (Q1374405) (← links)
- Progress with single-item lot-sizing (Q1390225) (← links)
- Optimization of the stochastic dynamic production cycling problem by a genetic algorithm. (Q1413842) (← links)
- The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability (Q1577995) (← links)
- Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
- Simultaneous lotsizing and scheduling considering secondary resources: a general model, literature review and classification (Q1733088) (← links)
- Hierarchical production control for a flow shop with dynamic setup changes and random machine breakdowns (Q1814871) (← links)
- Lot sizing in capacitated production planning and control systems (Q1891872) (← links)
- Capacitated lot-sizing with sequence dependent setup costs (Q1907207) (← links)
- Multi-stage simultaneous lot-sizing and scheduling for flow line production (Q1936588) (← links)
- Simultaneous lotsizing and scheduling by combining local search with dual reoptimization (Q1969833) (← links)
- A decomposition approach for the general lotsizing and scheduling problem for parallel production lines (Q2355899) (← links)
- Simultaneous lotsizing and scheduling problems: a classification and review of models (Q2362236) (← links)
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (Q2379665) (← links)
- Single item lot-sizing problem for a warm/cold process with immediate lost sales (Q2467270) (← links)
- Dynamic nonlinear modelization of operational supply chain systems (Q2494311) (← links)
- Modeling of period overlapping setup times (Q2503060) (← links)
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (Q2514881) (← links)
- Single item lot sizing problems (Q2566041) (← links)
- Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover (Q2668728) (← links)
- Discrete multi-module capacitated lot-sizing problems with multiple items (Q2670496) (← links)
- Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources (Q2997890) (← links)
- COMBINING PROCESS SELECTION AND LOT SIZING MODELS FOR PRODUCTION SCHEDULING OF ELECTROFUSED GRAINS (Q3392298) (← links)
- Um modelo de otimização para o problema integrado de dimensionamento de lotes e programação da produção em fábricas de refrigerantes (Q3625806) (← links)
- A real-time dynamic lot-sizing heuristic for a manufacturing system subject to random setup times (Q4230170) (← links)
- Multi-item, single-machine scheduling problem with stochastic demands: a comparison of heuristics (Q4394218) (← links)
- Campaign planning in time-indexed model formulations (Q4671374) (← links)
- Explicit modeling of multi-period setup times in proportional lot-sizing and scheduling problem with variable capacity (Q5097082) (← links)
