scientific article; zbMATH DE number 3485481

MaRDI QIDQ4068433zbMATHFDO

Authors Alexander H. G. Rinnooy Kan

Publication date 1973

Mathematics Subject Classification ID

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

Cited in

(9)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4068433)