Campus Event Calendar
Event Entry
What and Who
A linear time approximation scheme for job shop scheduling
Klaus Jansen
IDSIA Lugano
SIG Meeting
AG 1, AG 2
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Friday, 12 February 99
11:00
-- Not specified --
MPI
007
Saarbrücken
Abstract
We present a linear time approximation scheme for the non-preemptive
job shop scheduling problem when the number of machines and the number
of operations per job are constant. We also show how to extend the
approximation scheme for the preemptive version of the problem.
(joint work with Roberto Solis-Oba (Max-Planck Institute Saarbr\"ucken)
and Maxim Sviridenko (Sobolev Institute of Mathematics Novosibirsk)).
Contact
Zeev Nutov
--email hidden
passcode not visible
logged in users only