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

Total Source Mask Optimization: High-capacity, resist modeling, and production-ready mask solution

Moutaz Fakhry, Yuri Granik, et al.

SPIE Photomask Technology + EUV Lithography 2011

Paper

A generic grouping algorithm and its quantitative analysis

Arnon Amir, Michael Lindenbaum

IEEE Transactions on Pattern Analysis and Machine Intelligence

Conference paper

Performance data on new tunable attenuating PSM for 193nm and 157nm lithography

Hans Becker, Frank Schmidt, et al.

Photomask and Next-Generation Lithography Mask Technology 2004

Paper

Quantum Simulators: Architectures and Opportunities

Ehud Altman, Kenneth R. Brown, et al.

PRX Quantum

View all publications