scientific article; zbMATH DE number 1305540

MaRDI QIDQ4252432zbMATH OpenFDO

Authors Jay Sethuraman, Mark S. Squillante

Publication date 17 June 1999

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Optimal Scheduling of Multiclass Stochastic Systems
• Optimal scheduling of parallel machines with constrained resources
• A unified approach to scheduling on unrelated parallel machines
• Approximation algorithms for scheduling unrelated parallel machines
• scientific article; zbMATH DE number 3941253

Cited in

(19)

• Optimal parallel machines scheduling with availability constraints
• On controlling prioritized discrete event systems with real-time constraints
• Polynomial time approximation algorithms for machine scheduling: Ten open problems
• Parallel machine scheduling under a grade of service provision
• Designing PTASs for MIN-SUM scheduling problems
• Decentralized utilitarian mechanisms for scheduling games
• A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling
• Unrelated machine scheduling with stochastic processing times
• scientific article; zbMATH DE number 1206104 (Why is no real title available?)
• scientific article; zbMATH DE number 1086922 (Why is no real title available?)
• Scheduling problem with multi-purpose parallel machines
• Optimal Strategies for Multiclass Job Scheduling on a Single Machine With Controllable Processing Times
• Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations
• Concentration inequalities for nonlinear matroid intersection
• Concentration inequalities for nonlinear matroid intersection
• A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs
• Approximating weighted completion time via stronger negative correlation
• Time and energy driven online scheduling problem in EV charging
• Approximating unrelated machine weighted completion time using iterative rounding and computer assisted proofs

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