scientific article; zbMATH DE number 3521517

zbMATH Open0333.68040MaRDI QIDQ4099211FDOQ4099211

Authors Ravi Sethi, E. G. jun. Coffman

Publication date 1976

Mathematics Subject Classification ID

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

Cited in

(15)

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

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 Q4099211)