scientific article; zbMATH DE number 3521517

zbMath0333.68040MaRDI QIDQ4099211

Ravi Sethi, Edward G. jun. Coffman

Publication date: 1976

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Deterministic scheduling theory in operations research (90B35) Algorithms in computer science (68W99)

Related Items (15)

A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem ⋮ Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime ⋮ Approximate algorithms for the \(P\parallel C_{\max}\) problem ⋮ The longest processing time rule for identical parallel machines revisited ⋮ A note on posterior tight worst-case bounds for longest processing time schedules ⋮ The LPT heuristic for minimizing total load on a proportionate openshop ⋮ A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem ⋮ A state-of-the-art review of parallel-machine scheduling research ⋮ Minimizing the makespan in nonpreemptive parallel machine scheduling problem ⋮ Scheduling with bully selfish jobs ⋮ A note on LPT scheduling ⋮ A linear time approximation algorithm for multiprocessor scheduling ⋮ A general lower bound for the makespan problem ⋮ Worst-case analysis of heuristics for open shops with parallel machines ⋮ A note on the Coffman-Sethi bound for LPT scheduling

This page was built for publication: