A linear time approximation scheme for makespan minimization in an open shop with release dates

Alexander Kononov; Maxim Sviridenko

doi:10.1016/S0167-6377(02)00115-3

Operations Research Letters

Paper

01 Aug 2002

A linear time approximation scheme for makespan minimization in an open shop with release dates

View publication

Abstract

The existence of a linear time approximation scheme for makespan minimization was demonstrated in the multiprocessor open shop problem with release dates. The approximation scheme was linear and didn't require solving linear program.

Conference paper

Dither computing: a hybrid deterministic-stochastic computing framework

Paper

Optimal delay-cost scheduling control in fluid models of general nxn input-queued switches

Conference paper

Super-resolution of Turbulent Flows in the Absence of the High-Resolution Ground Truth

Conference paper

Revised SCLP-simplex Algorithm with Application to Large-Scale Fluid Processing Networks

View all publications

Abstract

Related

Dither computing: a hybrid deterministic-stochastic computing framework

Optimal delay-cost scheduling control in fluid models of general nxn input-queued switches

Super-resolution of Turbulent Flows in the Absence of the High-Resolution Ground Truth

Revised SCLP-simplex Algorithm with Application to Large-Scale Fluid Processing Networks