scientific article; zbMATH DE number 903952
From MaRDI portal
Publication:4885531
zbMath0869.90036MaRDI QIDQ4885531
Publication date: 15 July 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
schedulingbranch-and-cut algorithmfacet-defining inequalitiessingle machinevalid inequalitiespolyhedral combinatoricstotal completion timesetup costdelivery man problemdiscrete lot-sizingtime-window constraints
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
Discrete multi-module capacitated lot-sizing problems with multiple items ⋮ Single item lot sizing problems
This page was built for publication: