scientific article; zbMATH DE number 6472636
From MaRDI portal
Publication:5501838
zbMath1321.68502MaRDI QIDQ5501838
Publication date: 14 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (23)
Lower bounds for on-line single-machine scheduling. ⋮ Unnamed Item ⋮ The expected asymptotical ratio for preemptive stochastic online problem ⋮ Competitive analysis of preemptive single-machine scheduling ⋮ A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective ⋮ Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling ⋮ An improved greedy algorithm for stochastic online scheduling on unrelated machines ⋮ Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations ⋮ Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints ⋮ Scheduling problems in master-slave model ⋮ Approximability of average completion time scheduling on unrelated machines ⋮ Resource cost aware scheduling ⋮ A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective ⋮ The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates ⋮ Scheduling projects with labor constraints ⋮ On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems ⋮ An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time ⋮ A \(2.28\)-competitive algorithm for online scheduling on identical machines ⋮ LP-based online scheduling: From single to parallel machines ⋮ Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines ⋮ A 1. 47-approximation for a preemptive single-machine scheduling problem ⋮ Off-line admission control for general scheduling problems ⋮ The power of \(\alpha\)-points in preemptive single machine scheduling.
This page was built for publication:
