The worst-case ratio of algorithm A_KK for parallel machines scheduling with non-simultaneous machine available times

MaRDI QIDQ3518121zbMATH OpenFDO

Authors Cheng Lu, Meng Li, Jia Lu, Guochun Tang

Publication date 6 August 2008

zbMATH Keywords

makespanscheduling with non-simultaneous machine available timesworst-case ratio

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Worst-case ratio of \(A_{kk}\) algorithm for problem \(P_m,a_i\|C_{\max}\)
• Parallel machines scheduling with nonsimultaneous machine available time
• Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times
• Parallel scheduling problem with non-simultaneous machine available times
• scientific article; zbMATH DE number 1932350

Cited in

(2)

• Worst-case ratio of \(A_{kk}\) algorithm for problem \(P_m,a_i\|C_{\max}\)
• Improvement of the performance ratio bound for the GKK algorithm in parallel processor problems

This page was built for publication: The worst-case ratio of algorithm \(A_{KK}\) for parallel machines scheduling with non-simultaneous machine available times

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