Deterministic lotsizing models for production planning
deterministic lotsizingdynamic programmingLagrangean relaxationsimulated annealingtabu searchvalid inequalities
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Production models (90B30) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60) Applications of mathematical programming (90C90)
In this dissertation, the author investigates deterministic lotsizing problems, and provides an extensive overview of the existing simple mathematical models. He then introduces some new model formulations and solution procedures for more general situations in which capacity restrictions, setup times and sequencing aspects are considered explicitly. The most original material includes computational complexity results, and the use of Lagrangean relaxation, Dynamic Programming, Valid Inequalities, Simulated Annealing, and Tabu search for solution procedures.
- Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem
- Approximate reasoning for production planning
- Multi-level, single-machine lot sizing and scheduling (with initial inventory)
- Lot sizing and scheduling -- survey and extensions
- The stochastic dynamic product cycling problem
- A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
- A linear description of the discrete lot-sizing and scheduling problem
- The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
- The general lotsizing and scheduling problem
- The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
- Heuristic genetic algorithms for general capacitated lot-sizing problems
- Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs
- A polynomial algorithm for lot-size scheduling of two type tasks.
- Lot sizing in capacitated production planning and control systems
- Remanufacturing planning for the reverse Wagner/Whitin models
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
- Deterministic model for customized pilot manufacture production with various backplane sizes
- Lifting for mixed integer programs with variable upper bounds
- Statistical search methods for lotsizing problems
- Scalable methodology for supply chain inventory coordination with private information
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- An approach for integrated scheduling and lot-sizing
- Single item lot sizing problems
- Manufacturing lot-sizing, procurement and delivery schedules over a finite planning horizon
- Fenced in? Stochastic and deterministic planning models in a time-fenced, rolling-horizon scheduling system
- COMBINING PROCESS SELECTION AND LOT SIZING MODELS FOR PRODUCTION SCHEDULING OF ELECTROFUSED GRAINS
- The stochastic economic lot sizing problem for non-stop multi-grade production with sequence-restricted setup changeovers
- Trade‐Offs in JIT Production Planning for Multi‐Stage Systems: Balancing Work‐Load Variations and WIP Inventories
- Feasible Sequential Decisions and a Flexible Lagrangean‐Based Heuristic for Dynamic Multi‐Level Lot Sizing
- Heuristic procedure for a multiproduct dynamic lot-sizing problem with coordinated replenishments
- DLSP for two-stage multi-item batch production
- scientific article; zbMATH DE number 2084779 (Why is no real title available?)
- Multi-level multi-item lot size planning with limited resources and general manufacturing structure.
- Single-vendor multi-buyer inventory coordination under private information
This page was built for publication: Deterministic lotsizing models for production planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1202117)
