scientific article

zbMath1192.90070MaRDI QIDQ3579372

Jiří Sgall, Marek Krčál, Tomáš Ebenlendr

Publication date: 6 August 2010

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (19)

Makespan minimization on unrelated parallel machines with a few bags ⋮ Scheduling and fixed-parameter tractability ⋮ On the configuration LP for maximum budgeted allocation ⋮ Approximation algorithms for the graph balancing problem with two speeds and two job lengths ⋮ Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations ⋮ Structured Instances of Restricted Assignment with Two Processing Times ⋮ Graph balancing: a special case of scheduling unrelated parallel machines ⋮ Santa Claus Meets Hypergraph Matchings ⋮ On the configuration-LP for scheduling on unrelated machines ⋮ A 3/2-approximation algorithm for the graph balancing problem with two weights ⋮ Unrelated parallel machine scheduling -- perspectives and progress ⋮ Unnamed Item ⋮ Parallel machine scheduling with nested job assignment restrictions ⋮ A note on ``An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs ⋮ A note on graph balancing problems with restrictions ⋮ Scheduling jobs with release and delivery times subject to nested eligibility constraints ⋮ Bounding the Running Time of Algorithms for Scheduling and Packing Problems ⋮ Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments ⋮ Lazy Local Search Meets Machine Scheduling

This page was built for publication: