On-line scheduling of parallel machines to minimize total completion times

DOI10.1016/J.COR.2008.11.008zbMath1175.90177OpenAlexW2009134658MaRDI QIDQ1010275

Peihai Liu, Xi-wen Lu

Publication date: 3 April 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.11.008

zbMATH Keywords

on-line algorithmparallel machine schedulinganalysis of algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (12)

Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time ⋮ A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time ⋮ A best possible algorithm for an online scheduling problem with position-based learning effect ⋮ A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection ⋮ An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time ⋮ Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms ⋮ Online scheduling with linear deteriorating jobs to minimize the total weighted completion time ⋮ Applying ``peeling onion approach for competitive analysis in online scheduling with rejection ⋮ A \(2.28\)-competitive algorithm for online scheduling on identical machines ⋮ Online scheduling to minimize modified total tardiness with an availability constraint ⋮ Randomized selection algorithm for online stochastic unrelated machines scheduling ⋮ On-line booking policies and competitive analysis of medical examination in hospital

Cites Work

• On-line scheduling to minimize average completion time revisited.
• A class of on-line scheduling algorithms to minimize total completion time
• Approximation Techniques for Average Completion Time Scheduling
• LP-Based Online Scheduling: From Single to Parallel Machines
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Optimal on-line algorithms for single-machine scheduling
• Scheduling jobs that arrive over time
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
• Unnamed Item
• Unnamed Item

This page was built for publication: On-line scheduling of parallel machines to minimize total completion times