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

Characterization of a next generation step-and-scan system

Timothy J. Wiltshire, Joseph P. Kirk, et al.

SPIE Advanced Lithography 1998

Paper

Subspace iterative methods for eigenvalue problems

Tong Zhang, G.H. Golub, et al.

Linear Algebra and Its Applications

Paper

Output distribution of the burrows-wheeler transform

Karthik Visweswariah, Sanjeev Kulkarni, et al.

IEEE International Symposium on Information Theory - Proceedings

Conference paper

Bounds on the ergodic capacity of training-based multiple-antenna systems

Simeon Furrer, Dirk Dahlhaus

ISIT 2005

View all publications

Abstract

Related

Characterization of a next generation step-and-scan system

Subspace iterative methods for eigenvalue problems

Output distribution of the burrows-wheeler transform

Bounds on the ergodic capacity of training-based multiple-antenna systems