The discrete lot-sizing and scheduling problem
From MaRDI portal
Publication:582202
DOI10.1016/0377-2217(90)90245-7zbMath0689.90043OpenAlexW2028704098MaRDI QIDQ582202
Publication date: 1990
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(90)90245-7
Lagrange multipliersmanufacturingLagrangean relaxationbranch-and-boundComputational resultsdiscrete lot-sizingscheduling several products
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)
Related Items
The stochastic dynamic product cycling problem, Simultaneous lotsizing and scheduling problems: a classification and review of models, A linear description of the discrete lot-sizing and scheduling problem, The discrete lot-sizing and scheduling problem with sequence-dependent setup costs, Lot sizing in capacitated production planning and control systems, Dynamic capacitated lot-sizing problems: a classification and review of solution approaches, A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem, Multi-product valid inequalities for the discrete lot-sizing and scheduling problem, Buffer sizing in multi-product multi-reactor batch processes: Impact of allocation and campaign sizing policies, On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay, Capacitated lot-sizing with sequence dependent setup costs, The general lotsizing and scheduling problem, Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover, Discrete multi-module capacitated lot-sizing problems with multiple items, Explicit modeling of multi-period setup times in proportional lot-sizing and scheduling problem with variable capacity, Progress with single-item lot-sizing, Multi-stage simultaneous lot-sizing and scheduling for flow line production, Multi‐level, multi‐stage lot‐sizing and scheduling in the flexible flow shop with demand information updating, Single-item dynamic lot-sizing problems: an updated survey, Optimization of the stochastic dynamic production cycling problem by a genetic algorithm., Modeling industrial lot sizing problems: a review, Simultaneous lotsizing and scheduling by combining local search with dual reoptimization, Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources, Simultaneous lotsizing and scheduling considering secondary resources: a general model, literature review and classification, Multilevel capacitated lot-sizing and resource-constrained project scheduling: an integrating perspective, Single item lot-sizing problem for a warm/cold process with immediate lost sales, Multi-level multi-item lot size planning with limited resources and general manufacturing structure., A comparison of two lot sizing-sequencing heuristics for the process industry, Multi-item, single-machine scheduling problem with stochastic demands: a comparison of heuristics, Campaign planning in time-indexed model formulations, Dynamic nonlinear modelization of operational supply chain systems, Modeling of period overlapping setup times, Real-world extensions to scheduling algorithms based on Lagrangian relaxation, Discrepancies in solutions between traditional and net present value formulations of finite horizon, discrete-time economic lot size problems, On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times, An evaluation of semidefinite programming based approaches for discrete lot-sizing problems, Discrete lot sizing and scheduling using product decomposition into attributes, Um modelo de otimização para o problema integrado de dimensionamento de lotes e programação da produção em fábricas de refrigerantes, Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory, Multi-level, single-machine lot sizing and scheduling (with initial inventory), Hierarchical production control for a flow shop with dynamic setup changes and random machine breakdowns, COMBINING PROCESS SELECTION AND LOT SIZING MODELS FOR PRODUCTION SCHEDULING OF ELECTROFUSED GRAINS, Solution approaches for the soft drink integrated production lot sizing and scheduling problem, 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, Lot sizing and scheduling -- survey and extensions, Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants, Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem, The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability, Single item lot sizing problems, Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions, A real-time dynamic lot-sizing heuristic for a manufacturing system subject to random setup times, The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming, A decomposition approach for the general lotsizing and scheduling problem for parallel production lines
Cites Work
- Unnamed Item
- Planning lot sizes and capacity requirements in a single stage production system
- Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Optimal Lot-Sizing Algorithms for Complex Product Structures
- The Dynamic Lot-Sizing Problem with Startup and Reservation Costs
- A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem
- A Production Scheduling Model by Bivalent Linear Programming
- An Efficient Algorithm for Multi-Item Scheduling
