The exact bound of Lee's MLPT

DOI10.1016/S0166-218X(97)00139-XzbMATH Open0911.90214MaRDI QIDQ1130187FDOQ1130187

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

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

zbMATH Keywords

parallel machines schedulingworst-case performance ratioexact valuenonsimultaneous machine available times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

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

Cited In (3)

• Graham's example is the only tight one for \(P \parallel C_{max}\)
• Title not available (Why is that?)
• A modified LPT algorithm for the two uniform parallel machine makespan minimization problem

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)