A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem

DOI10.1287/opre.36.1.50zbMath0657.90045OpenAlexW2097115813MaRDI QIDQ3806967

André Gascon, Robert C. Leachman

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

zbMATH Keywords

single machinechangeover and inventory holding costsproduction of multiple itemstime-varying deterministic demands

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

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 ⋮ An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times ⋮ 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 ⋮ The discrete lot-sizing and scheduling problem ⋮ A time-dependent multiple criteria single-machine scheduling problem ⋮ A practical dynamic programming based methodology for aircraft maintenance check scheduling optimization ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems