Weighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximability

DOI10.1016/j.disopt.2012.11.002zbMath1258.90040OpenAlexW1974854113MaRDI QIDQ1941538

Vangelis Th. Paschos, Imed Kacem

Publication date: 13 March 2013

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

Full work available at URL: https://doi.org/10.1016/j.disopt.2012.11.002

zbMATH Keywords

schedulingworst-case analysisdifferential approximationweighted flow-time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications ⋮ Single-machine scheduling with operator non-availability to minimize total weighted completion time ⋮ Differential approximation schemes for half-product related functions and their scheduling applications ⋮ Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance

This page was built for publication: Weighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximability