A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem
From MaRDI portal
Publication:3806967
DOI10.1287/opre.36.1.50zbMath0657.90045MaRDI QIDQ3806967
Robert C. Leachman, André Gascon
Publication date: 1988
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.36.1.50
single machine; changeover and inventory holding costs; production of multiple items; time-varying deterministic demands
90B35: Deterministic scheduling theory in operations research
90B30: Production models
90C39: Dynamic programming
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Multi-item, single-machine scheduling problem with stochastic demands: a comparison of heuristics, A framework for modelling setup carryover in the capacitated lot sizing problem, A time-dependent multiple criteria single-machine scheduling problem, The discrete lot-sizing and scheduling problem, The discrete lot-sizing and scheduling problem with sequence-dependent setup costs, A Lagrangean decomposition solution to a single line multiproduct scheduling problem, Lot-size scheduling of two types of jobs on identical machines, Scheduling continuous aluminium casting lines