Publication:3140449
From MaRDI portal
zbMath0801.68014MaRDI QIDQ3140449
Publication date: 15 December 1993
68Q25: Analysis of algorithms and problem complexity
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Task scheduling in networks, The constrained minimum spanning tree problem, On-line scheduling of parallel jobs, Compact location problems with budget and communication constraints, Improved algorithmic results for unsplittable stable allocation problems, Bicriteria scheduling problem for unrelated parallel machines with release dates, Energy-efficient multiprocessor scheduling for flow time and makespan, Approximation schemes for generalized two-dimensional vector packing with application to data placement, Optimizing performance and reliability on heterogeneous parallel systems: approximation algorithms and heuristics, Budgeted matching and budgeted matroid intersection via the gasoline puzzle, Minimal cost reconfiguration of data placement in a storage area network, Minimizing average flow-time under knapsack constraint, Approximation algorithms for general parallel task scheduling, Resource constrained scheduling on multiple machines, Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
