scientific article; zbMATH DE number 2102785

zbMath1046.68505MaRDI QIDQ4818873

David B. Shmoys, Soumen Chakrabarti, Andreas S. Schulz, Clifford Stein, Joel M. Wein, Cynthia A. Phillips

Publication date: 24 September 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (31)

Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time ⋮ A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time ⋮ On the existence of schedules that are near-optimal for both makespan and total weighted completion time ⋮ On-line load balancing for related machines ⋮ News from the online traveling repairman. ⋮ An improved greedy algorithm for stochastic online scheduling on unrelated machines ⋮ Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations ⋮ Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling ⋮ A time-indexed LP-based approach for min-sum job-shop problems ⋮ Precedence constrained scheduling to minimize sum of weighted completion times on a single machine ⋮ On a local protocol for concurrent file transfers ⋮ Scheduling problems in master-slave model ⋮ Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds ⋮ Incremental medians via online bidding ⋮ The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates ⋮ A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting ⋮ Order Scheduling Models: Hardness and Algorithms ⋮ Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates ⋮ LP-based online scheduling: From single to parallel machines ⋮ Select and permute: an improved online framework for scheduling to minimize weighted completion time ⋮ An improved approximation algorithm for scheduling under arborescence precedence constraints ⋮ Combinatorial algorithms for data migration to minimize average completion time ⋮ Minimizing average completion time in the presence of release dates ⋮ A 1. 47-approximation for a preemptive single-machine scheduling problem ⋮ Multicriteria scheduling ⋮ Stochastic Online Scheduling Revisited ⋮ Fairness in parallel job scheduling ⋮ Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time ⋮ Off-line admission control for general scheduling problems ⋮ The power of \(\alpha\)-points in preemptive single machine scheduling. ⋮ Approximation algorithms for shop scheduling problems with minsum objective

This page was built for publication: