Graham's example is the only tight one for P C_max

zbMATH Open1086.90508MaRDI QIDQ3373906FDOQ3373906

Authors: György Dósa 

Publication date: 9 March 2006

Recommendations

• A note on LPT scheduling
• The exact bound of Lee's MLPT
• The exact LPT-bound for maximizing the minimum completion time
• scientific article; zbMATH DE number 34575
• The longest processing time rule for identical parallel machines revisited

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (1)

• The longest processing time rule for identical parallel machines revisited

This page was built for publication: Graham's example is the only tight one for \(P \parallel C_{max}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3373906)