The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability

DOI10.1016/S0377-2217(99)00190-3zbMath0967.90043MaRDI QIDQ1577995

Hermann Jahnke, Wolfgang Brüggemann

Publication date: 19 September 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

complexitymanufacturingbatch availabilitydiscrete lot-sizing and scheduling problemmixed-integer linear programsimulated-annealing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mixed integer programming (90C11) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (10)

Simultaneous lotsizing and scheduling problems: a classification and review of models ⋮ Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay ⋮ Dynamic lot sizing for multiple products with a new joint replenishment model ⋮ Modeling industrial lot sizing problems: a review ⋮ Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources ⋮ Single item lot-sizing problem for a warm/cold process with immediate lost sales ⋮ COMBINING PROCESS SELECTION AND LOT SIZING MODELS FOR PRODUCTION SCHEDULING OF ELECTROFUSED GRAINS ⋮ Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• The discrete lot-sizing and scheduling problem
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Analysis of relaxations for the multi-item capacitated lot-sizing problem
• Batching in single operation manufacturing systems
• Deterministic lotsizing models for production planning
• 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
• The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming
• The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
• Batching to Minimize Flow Times on One Machine
• Simulated Annealing – An Annotated Bibliography
• Some Extensions of the Discrete Lotsizing and Scheduling Problem
• Job Shop Scheduling by Simulated Annealing
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• `` Strong NP-Completeness Results
• A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
• Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem”
• Scheduling Groups of Jobs on a Single Machine
• Equation of State Calculations by Fast Computing Machines
• Minimum Change-Over Scheduling of Several Products on One Machine
• An Efficient Algorithm for Multi-Item Scheduling

This page was built for publication: The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability