On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs

DOI10.1016/S0167-6377(96)00043-0zbMath0889.90084OpenAlexW2107647148WikidataQ127829822 ScholiaQ127829822MaRDI QIDQ1374379

C. A. van Eijl, Stan P. M. van Hoesel

Publication date: 15 January 1998

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(96)00043-0

zbMATH Keywords

polyhedral combinatoricsconvex hull of feasible solutionssingle-item discrete lot-sizingWagner-Whitin costs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Inventory, storage, reservoirs (90B05)

Related Items

Simultaneous lotsizing and scheduling problems: a classification and review of models, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, Multi-product valid inequalities for the discrete lot-sizing and scheduling problem, On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs, Discrete multi-module capacitated lot-sizing problems with multiple items, Single-item dynamic lot-sizing problems: an updated survey, LS-LIB: A Library of Tools for Solving Production Planning Problems, Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources, On discrete lot-sizing and scheduling on identical parallel machines, Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company, 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, A maritime inventory routing problem: Discrete time formulations and valid inequalities, COMBINING PROCESS SELECTION AND LOT SIZING MODELS FOR PRODUCTION SCHEDULING OF ELECTROFUSED GRAINS, Scheduling multiprocessor tasks -- An overview

Cites Work

• Unnamed Item
• On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
• Polyhedra for lot-sizing with Wagner-Whitin costs
• A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs