Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time

DOI10.1080/10556788.2013.854360zbMath1299.90131MaRDI QIDQ2926062

Panos M. Pardalos, Mikhail Batsyn, Boris I. Goldengorin, Pavel Sukhov

Publication date: 29 October 2014

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2013.854360

zbMATH Keywords

single machine scheduling; efficient heuristic; weighted shortest remaining processing time; WSRPT rule

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems