Scheduling: Control-based theory and polynomial-time algorithms
zbMath1016.90017MaRDI QIDQ5948297
Eugene Khmelnitsky, Konstantin Kogan
Publication date: 5 November 2001
Published in: Applied Optimization (Search for Journal in Brave)
combinatoricsoptimal controlperformance measurescontinuous-time schedulingcontrol-based schedulingeffective polynomial-time algorithmsgeneric scheduling problemslimited capacitynumber of machines and productsone-machine problemsparallel machine problemsproduction constraintsserial machine problemsunlimited capacity
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items