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

EXAMPLES OF USING THE RESEARCH QUEUEING PACKAGE MODELING ENVIRONMENT (RESQME).

Robert F. Gordon, Edward A. MacNair, et al.

WSC 1985

Paper

Best L¹ approximation by weak chebyshev systems and the uniqueness of interpolating perfect splines

Charles A Micchelli

Journal of Approximation Theory

Paper

Neural network based iterative learning control for product qualities in batch processes

Zhihua Xiong, Yixin Xu, et al.

International Journal of Modelling, Identification and Control

Paper

Airy stress function for atomic models

Paul J. Steinhardt, P. Chaudhari

Journal of Computational Physics

View all publications

Abstract

Related

EXAMPLES OF USING THE RESEARCH QUEUEING PACKAGE MODELING ENVIRONMENT (RESQME).

Best L1 approximation by weak chebyshev systems and the uniqueness of interpolating perfect splines

Neural network based iterative learning control for product qualities in batch processes

Airy stress function for atomic models

Best L¹ approximation by weak chebyshev systems and the uniqueness of interpolating perfect splines