The discrete lot-sizing and scheduling problem with sequence-dependent setup costs

DOI10.1016/0377-2217(94)90083-3zbMath0804.90070MaRDI QIDQ1331615

Bernhard Fleischmann

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

zbMATH Keywords

Lagrange multipliers; Lagrangean relaxation; single machine; time windows; travelling salesman; lot-sizing; dynamic demand; several products

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Modeling industrial lot sizing problems: a review, Discrepancies in solutions between traditional and net present value formulations of finite horizon, discrete-time economic lot size problems, The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, Discrete lot sizing and scheduling using product decomposition into attributes, 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 general lotsizing and scheduling problem, The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability, Simultaneous lotsizing and scheduling on parallel machines, Capacitated lot-sizing with sequence dependent setup costs, Simultaneous lotsizing and scheduling by combining local search with dual reoptimization, Dynamic nonlinear modelization of operational supply chain systems, Production control in a two-stage system, COMBINING PROCESS SELECTION AND LOT SIZING MODELS FOR PRODUCTION SCHEDULING OF ELECTROFUSED GRAINS, Um modelo de otimização para o problema integrado de dimensionamento de lotes e programação da produção em fábricas de refrigerantes

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