scientific article

zbMath0309.90026MaRDI QIDQ4068433

Alexander H. G. Rinnooy Kan

Publication date: 1973

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Mathematical programming (90C99) Hamilton-Jacobi theories (49L99)

Related Items (9)

Formulating the single machine sequencing problem with release dates as a mixed integer program ⋮ Reducibility among single machine weighted completion time scheduling problems ⋮ Flow-shops with a dominant machine ⋮ A new heuristic for the n-job, M-machine flow-shop problem ⋮ A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints ⋮ Four solution techniques for a general one machine scheduling problem. A comparative study ⋮ An SA/TS mixture algorithm for the scheduling tardiness problem ⋮ Management of periodic demands in distribution systems ⋮ A polynomial algorithm for lot-size scheduling of two type tasks.

This page was built for publication: