The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
From MaRDI portal
Publication:1331615
DOI10.1016/0377-2217(94)90083-3zbMath0804.90070OpenAlexW2027349770MaRDI QIDQ1331615
Publication date: 21 August 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90083-3
Lagrange multipliersLagrangean relaxationsingle machinetime windowstravelling salesmanlot-sizingdynamic demandseveral products
Related Items
Simultaneous lotsizing and scheduling problems: a classification and review of models, Modeling lotsizing and scheduling problems with sequence dependent setups, 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, Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems, 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, Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows, Multiple machine continuous setup lotsizing with sequence-dependent setups, Modeling industrial lot sizing problems: a review, Simultaneous lotsizing and scheduling by combining local search with dual reoptimization, Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal, New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem, Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups, The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times, Dynamic nonlinear modelization of operational supply chain systems, Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration, Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem, Production control in a two-stage system, Discrepancies in solutions between traditional and net present value formulations of finite horizon, discrete-time economic lot size 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, COMBINING PROCESS SELECTION AND LOT SIZING MODELS FOR PRODUCTION SCHEDULING OF ELECTROFUSED GRAINS, 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, The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability, Simultaneous lotsizing and scheduling on parallel machines
Cites Work
- Unnamed Item
- Unnamed Item
- The discrete lot-sizing and scheduling problem
- An efficient implementation of local search algorithms for constrained routing problems
- Deterministic lotsizing models for production planning
- A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
- The Deterministic Dynamic Product Cycling Problem
- The Dynamic Lot-Sizing Problem with Startup and Reservation Costs
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
- A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem
