The general lotsizing and scheduling problem

DOI10.1007/BF01539800zbMath0892.90055MaRDI QIDQ1374405

Herbert Meyr, Bernhard Fleischmann

Publication date: 3 August 1998

Published in: OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

local search; threshold accepting; heuristic; general lotsizing and scheduling problem

Mathematics Subject Classification ID

90B05: Inventory, storage, reservoirs

Related Items

Modeling industrial lot sizing problems: a review, Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups, Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions, Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, Capacitated lot-sizing with extensions: a review, Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching, Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration, Solution approaches for the soft drink integrated production lot sizing and scheduling problem, 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, Supply chain optimization in the pulp mill industry -- IP models, column generation and novel constraint branches., Simultaneous lotsizing and scheduling on parallel machines, Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs, Simultaneous lotsizing and scheduling by combining local search with dual reoptimization, Dynamic capacitated lot-sizing problems: a classification and review of solution approaches, Lot sizing and furnace scheduling in small foundries, Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company, Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs, An approach for integrated scheduling and lot-sizing, Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem, MIP-based heuristics for lotsizing in capacitated pure flow shop with sequence-dependent setups, Um modelo de otimização para o problema integrado de dimensionamento de lotes e programação da produção em fábricas de refrigerantes, Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over

Uses Software

• LINDO

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• The discrete lot-sizing and scheduling problem
• Multilevel capacitated lotsizing complexity and LP-based heuristics
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Deterministic lotsizing models for production planning
• Studying the effects of production loss due to setup in dynamic production scheduling
• Lotsizing and scheduling for production planning
• The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
• A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems
• Capacitated lot-sizing with sequence dependent setup costs
• Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs
• The Deterministic Dynamic Product Cycling Problem
• An Efficient Algorithm for Multi-Item Scheduling