scientific article; zbMATH DE number 1946760

MaRDI QIDQ4411083zbMATH OpenFDO

Authors David D. Yao

Publication date 7 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2459/24590089.htm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• scientific article; zbMATH DE number 1060044
• Dynamic problems of scheduling
• Optimal scheduling combinatorics
• scientific article; zbMATH DE number 826383
• scientific article; zbMATH DE number 876684
• Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results
• An analog of the flexible polyhedron method for scheduling problems
• Optimization applications in scheduling theory
• Dynamic algorithms for monotonic interval scheduling problem

Cited in

(12)

• Dynamic schedule optimization based on a correlation scheduling model
• Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
• Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control
• Dynamising Interval Scheduling: The Monotonic Case
• Submodular returns and greedy heuristics for queueing scheduling problems
• Dynamic scheduling to minimize lost sales subject to set-up costs
• Sensitivity analysis for convex separable optimization over integral polymatroids
• Nested Optimal Policies for Set Functions with Applications to Scheduling
• Sample-path conservation laws, with applications to scheduling queues and fluid systems
• Asynchronous optimization over weakly coupled renewal systems
• Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
• Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule

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 Q4411083)