scientific article; zbMATH DE number 437570

MaRDI QIDQ3140449zbMATH OpenFDO

Authors David B. Shmoys, Éva Tardos

Publication date 15 December 1993

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)

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

Cited in

(22)

• The generalization of scheduling with machine cost
• The constrained minimum spanning tree problem
• Energy-efficient multiprocessor scheduling for flow time and makespan
• Minimal cost reconfiguration of data placement in a storage area network
• Budgeted matching and budgeted matroid intersection via the gasoline puzzle
• Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\)
• 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
• Optimizing performance and reliability on heterogeneous parallel systems: approximation algorithms and heuristics
• Resource constrained scheduling on multiple machines
• On-line scheduling of parallel jobs
• 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
• scientific article; zbMATH DE number 1875417 (Why is no real title available?)
• Bicriteria scheduling problem for unrelated parallel machines with release dates
• Task scheduling in networks
• Optimal algorithms and a PTAS for cost-aware scheduling

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)