Operations Research Letters

Paper

01 Sep 2008

High-multiplicity cyclic job shop scheduling

View publication

Abstract

We consider the High-Multiplicity Cyclic Job Shop Scheduling Problem. There are two objectives of interest: the cycle time and the flow time. We give several approximation algorithms after showing that a very restricted case is APX-hard. © 2008 Elsevier B.V. All rights reserved.

Related

Paper

On the complexity of some geometric problems in unbounded dimension

Nimrod Megiddo

Journal of Symbolic Computation

Conference paper

Strategies for registering range images from unknown camera positions

Fausto Bernardini, Holly Rushmeier

Proceedings of SPIE - The International Society for Optical Engineering

Paper

Dynamic graph and polynomial chaos based models for contact tracing data analysis and optimal testing prescription

Shashanka Ubaru, Lior Horesh, et al.

Journal of Biomedical Informatics

Paper

Efficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems *

Y.Y. Li, K.S. Leung, et al.

J Combin Optim

View all publications