scientific article; zbMATH DE number 437570

zbMATH Open0801.68014MaRDI QIDQ3140449FDOQ3140449

Authors: David B. Shmoys, Éva Tardos 

Publication date: 15 December 1993

Title of this publication is not available (Why is that?)

Recommendations

• Improved approximation schemes for scheduling unrelated parallel machines
• Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
• Approximate algorithms for unrelated machine scheduling to minimize makespan
• scientific article; zbMATH DE number 1875417
• Optimal algorithms and a PTAS for cost-aware scheduling

zbMATH Keywords

optimizationinteger programmingschedulingmakespanparallel machineslinear relaxations

Mathematics Subject Classification ID

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)

Cited In (22)

• The generalization of scheduling with machine cost
• Energy-efficient multiprocessor scheduling for flow time and makespan
• Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\)
• Minimal cost reconfiguration of data placement in a storage area network
• Budgeted matching and budgeted matroid intersection via the gasoline puzzle
• Approximation schemes for generalized two-dimensional vector packing with application to data placement
• Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
• Improved approximation schemes for scheduling unrelated parallel machines
• Approximation algorithms for general parallel task scheduling
• On-line scheduling of parallel jobs
• Resource constrained scheduling on multiple machines
• Optimizing performance and reliability on heterogeneous parallel systems: approximation algorithms and heuristics
• Fast approximation algorithms for bi-criteria scheduling with machine assignment costs
• Stochastic Scheduling on Unrelated Machines
• Compact location problems with budget and communication constraints
• Improved algorithmic results for unsplittable stable allocation problems
• Minimizing average flow-time under knapsack constraint
• Title not available (Why is that?)
• Bicriteria scheduling problem for unrelated parallel machines with release dates
• Task scheduling in networks
• Optimal algorithms and a PTAS for cost-aware scheduling
• The constrained minimum spanning tree problem

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