Flow-time optimization for concurrent open-shop and precedence constrained scheduling models

DOI10.4230/LIPICS.APPROX-RANDOM.2018.16MaRDI QIDQ5009508zbMATH OpenOpenAlexFDO

Authors Janardhan Kulkarni, Shi Li

Publication date 4 August 2021

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

zbMATH Keywords

approximationconcurrent open shopprecedence constraintsweighted flow time

Mathematics Subject Classification ID

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

Recommendations

• On scheduling coflows
• On scheduling coflows (extended abstract)
• On scheduling multiple two-stage flowshops
• Open shop scheduling with machine dependent processing times
• Precedence-constrained scheduling of malleable jobs with preemption

Cited in

(4)

• On scheduling coflows
• scientific article; zbMATH DE number 5665941 (Why is no real title available?)
• History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence
• Non-Clairvoyant Precedence Constrained Scheduling.

This page was built for publication: Flow-time optimization for concurrent open-shop and precedence constrained scheduling models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009508)