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

Conference paper

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

M.B. Small, R.M. Potemski

Proceedings of SPIE 1989

Paper

Output distribution of the burrows-wheeler transform

Karthik Visweswariah, Sanjeev Kulkarni, et al.

IEEE International Symposium on Information Theory - Proceedings

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

Conference paper

Modeling polarization for Hyper-NA lithography tools and masks

Kafai Lai, Alan E. Rosenbluth, et al.

SPIE Advanced Lithography 2007

View all publications