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

DOI10.1007/S11590-015-0862-YMaRDI QIDQ5963697zbMATH OpenOpenAlexFDO

Authors Wenjie 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

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

Recommendations

• Online LPT algorithms for parallel machines scheduling with a single server
• Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines
• LP-based online scheduling: From single to parallel machines
• LP-Based Online Scheduling: From Single to Parallel Machines
• Online scheduling on two parallel machines with release times and delivery times
• scientific article; zbMATH DE number 1810114
• Online scheduling on two parallel machines with release dates and delivery times
• An optimal online algorithm for scheduling two machines with release times
• Online parallel-machine scheduling in KRT environment to minimize total weighted completion time
• Approximation and Online Algorithms

Cites work

• scientific article; zbMATH DE number 1094690 (Why is no real title available?)
• Aggressive online deadline scheduling
• An optimal online algorithm for scheduling two machines with release times
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• On-line scheduling on a single machine: Maximizing the number of early jobs
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
• Scheduling on identical machines: How good is LPT in an on-line setting?
• Scheduling with deadlines and loss functions
• `` Strong NP-Completeness Results

Cited in

(7)

• Online batch scheduling with kind release times and incompatible families to minimize makespan
• LP-Based Online Scheduling: From Single to Parallel Machines
• Online scheduling on a bounded batch machine with same-length-job families
• Online scheduling of jobs with kind release times and deadlines on a single machine
• Online parallel-machine scheduling in KRT environment to minimize total weighted completion time
• Online LPT algorithms for parallel machines scheduling with a single server
• A best possible online algorithm for parallel-batch scheduling with kind release times and job compatibilities

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

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