Flow-time Optimization for Concurrent Open-Shop and Precedence Constrained Scheduling Models.

DOI10.4230/LIPICS.APPROX-RANDOM.2018.16OpenAlexW2838819579MaRDI QIDQ5009508

Shi Li, Janardhan Kulkarni

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1807.02553

zbMATH Keywords

approximationprecedence constraintsweighted flow timeconcurrent open shop

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

Non-Clairvoyant Precedence Constrained Scheduling.

This page was built for publication: Flow-time Optimization for Concurrent Open-Shop and Precedence Constrained Scheduling Models.