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.

Paper

Classification with nonmetric distances: Image retrieval and class representation

David W. Jacobs, Daphna Weinshall, et al.

IEEE Transactions on Pattern Analysis and Machine Intelligence

Conference paper

Compound semiconductor surface and interface problems in liquid phase epitaxy (lpe)

M.B. Small, R.M. Potemski

Proceedings of SPIE 1989

Paper

Kinematic theory of signature verification measurements

John S. Lew

Mathematical Biosciences

Paper

Bonsai trees, or how to delegate a lattice basis

David Cash, Dennis Hofheinz, et al.

Journal of Cryptology

View all publications

Abstract

Related

Classification with nonmetric distances: Image retrieval and class representation

Compound semiconductor surface and interface problems in liquid phase epitaxy (lpe)

Kinematic theory of signature verification measurements

Bonsai trees, or how to delegate a lattice basis