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

Multiparameter parallel search branch switching

Michael E. Henderson

International Journal of Bifurcation and Chaos in Applied Sciences and Engineering

Conference paper

A reinforcement learning approach to production planning in the fabrication/fulfillment manufacturing process

Heng Cao, Haifeng Xi, et al.

WSC 2003

Conference paper

Distilling common randomness from bipartite quantum states

Igor Devetak, Andreas Winter

ISIT 2003

Paper

Output distribution of the burrows-wheeler transform

Karthik Visweswariah, Sanjeev Kulkarni, et al.

IEEE International Symposium on Information Theory - Proceedings

View all publications