High-multiplicity cyclic job shop scheduling

Authors:
Tracy Kimbrel;Maxim Sviridenko
Affiliations:
IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, United States;IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, United States
Venue:
Operations Research Letters
Year:
2008

Citing 10
Cited 2

Cyclic schedules for job shops with identical jobs

Mathematics of Operations Research
Improved Approximation Algorithms for Shop Scheduling Problems

SIAM Journal on Computing
Randomized algorithms

Randomized algorithms
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Better Approximation Guarantees for Job-Shop Scheduling

SIAM Journal on Discrete Mathematics
Improved approximation of max-cut on graphs of bounded degree

Journal of Algorithms
MAX CUT in cubic graphs

Journal of Algorithms
Job Shop Scheduling with Unit Processing Times

Mathematics of Operations Research
Paintshop, odd cycles and necklace splitting

Discrete Applied Mathematics
Some complexity results in cyclic scheduling

Mathematical and Computer Modelling: An International Journal

A hybridization of simulated annealing and electromagnetism-like mechanism for a periodic job shop scheduling problem

Expert Systems with Applications: An International Journal
A genetic algorithm for the job shop on an ASRS warehouse

ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

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.