Scheduling: Control-based theory and polynomial-time algorithms

MaRDI QIDQ5948297zbMATH OpenFDO

Authors Konstantin Kogan, Eugene Khmelnitsky

Publication date 5 November 2001

Published in Applied Optimization (Search for Journal in Brave)

zbMATH Keywords

combinatoricscontinuous-time schedulingcontrol-based schedulingeffective polynomial-time algorithmsgeneric scheduling problemslimited capacitynumber of machines and productsone-machine problemsoptimal controlparallel machine problemsperformance measuresproduction constraintsserial machine problemsunlimited capacity

Mathematics Subject Classification ID

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) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 2114378
• Scheduling. Theory, algorithms, and systems.
• Optimal flow control in manufacturing systems. Production planning and scheduling. Incl. 1 disk
• scientific article; zbMATH DE number 519878
• Scheduling

Cited in

(8)

• Guaranteed cost control for multi-inventory systems with uncertain demand.
• Control of resource-intensive computations under uncertainty. II. Scheduling complex
• Dynamic supply chain scheduling
• Necessity constraint in two plant optimal production problem with imprecise parameters
• Capacitated planned maintenance. Models, optimization algorithms, combinatorial and polyhedral properties
• scientific article; zbMATH DE number 47256 (Why is no real title available?)
• scientific article; zbMATH DE number 519878 (Why is no real title available?)
• Scheduler modeling based on the controller synthesis paradigm

This page was built for publication: Scheduling: Control-based theory and polynomial-time algorithms

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