scientific article
From MaRDI portal
Publication:3140449
zbMath0801.68014MaRDI QIDQ3140449
Publication date: 15 December 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (15)
Task scheduling in networks ⋮ The constrained minimum spanning tree problem ⋮ Improved algorithmic results for unsplittable stable allocation problems ⋮ Resource constrained scheduling on multiple machines ⋮ Bicriteria scheduling problem for unrelated parallel machines with release dates ⋮ On-line scheduling of parallel jobs ⋮ Energy-efficient multiprocessor scheduling for flow time and makespan ⋮ Compact location problems with budget and communication constraints ⋮ Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle ⋮ Minimizing average flow-time under knapsack constraint ⋮ 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 ⋮ Minimal cost reconfiguration of data placement in a storage area network ⋮ Budgeted matching and budgeted matroid intersection via the gasoline puzzle ⋮ Approximation algorithms for general parallel task scheduling
This page was built for publication:
