LPT online strategy for parallel-machine scheduling with kind release times
From MaRDI portal
Publication:5963697
DOI10.1007/S11590-015-0862-YzbMATH Open1337.90027OpenAlexW2048609769MaRDI QIDQ5963697FDOQ5963697
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
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- 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
- Scheduling with deadlines and loss functions
- `` Strong NP-Completeness Results
- Aggressive online deadline scheduling
- Scheduling on identical machines: How good is LPT in an on-line setting?
- An optimal online algorithm for scheduling two machines with release times
Cited In (4)
- Online batch scheduling with kind release times and incompatible families to minimize makespan
- LP-Based Online Scheduling: From Single to Parallel Machines
- Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time
- Online scheduling of jobs with kind release times and deadlines on a single machine
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 👍 👎
- Title not available (Why is that?) 👍 👎
- 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 👍 👎
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)
