LPT online strategy for parallel-machine scheduling with kind release times

DOI10.1007/S11590-015-0862-YzbMath1337.90027OpenAlexW2048609769MaRDI QIDQ5963697

Wen-Jie Li, Jinjiang Yuan

Publication date: 23 February 2016

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-015-0862-y

zbMATH Keywords

schedulingmakespanonline algorithmkind release timeLPT strategy

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Online scheduling of jobs with kind release times and deadlines on a single machine ⋮ Online batch scheduling with kind release times and incompatible families to minimize makespan ⋮ Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling on identical machines: How good is LPT in an on-line setting?
• Scheduling with Deadlines and Loss Functions
• `` Strong NP-Completeness Results
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
• On-line scheduling on a single machine: Maximizing the number of early jobs
• An optimal online algorithm for scheduling two machines with release times

This page was built for publication: LPT online strategy for parallel-machine scheduling with kind release times