The exact bound of Lee's MLPT

DOI10.1016/S0166-218X(97)00139-XMaRDI QIDQ1130187zbMATH OpenFDO

Authors Guohui Lin

Publication date 20 August 1998

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://www.elsevier.com/locate/dam

zbMATH Keywords

exact valuenonsimultaneous machine available timesparallel machines schedulingworst-case performance ratio

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Exact bounds of the modified LPT algorithms applying to parallel machines scheduling with nonsimultaneous machine available times
• scientific article; zbMATH DE number 1150234
• A modified LPT algorithm for the two uniform parallel machine makespan minimization problem
• Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times

Cites work

• Bounds on Multiprocessing Timing Anomalies
• Parallel machines scheduling with nonsimultaneous machine available time

Cited in

(4)

• Exact bounds of the modified LPT algorithms applying to parallel machines scheduling with nonsimultaneous machine available times
• A modified LPT algorithm for the two uniform parallel machine makespan minimization problem
• Graham's example is the only tight one for \(P \parallel C_{max}\)
• scientific article; zbMATH DE number 2163546 (Why is no real title available?)

This page was built for publication: The exact bound of Lee's MLPT

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