scientific article; zbMATH DE number 3485481
From MaRDI portal
Publication:4068433
zbMATH Open0309.90026MaRDI QIDQ4068433FDOQ4068433
Authors: Alexander H. G. Rinnooy Kan 
Publication date: 1973
Title of this publication is not available (Why is that?)
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)
- A polynomial algorithm for lot-size scheduling of two type tasks.
- Flow-shops with a dominant machine
- 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
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- Management of periodic demands in distribution systems
- Reducibility among single machine weighted completion time scheduling problems
- A new heuristic for the n-job, M-machine flow-shop problem
- An SA/TS mixture algorithm for the scheduling tardiness problem
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)
