Conference paper
QALD-3: Multilingual question answering over linked data
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
The preemptive job shop scheduling problem with two machines, with the objective to minimize the makespan is studied. An algorithm to find a schedule of length greater than the optimal schedule length is also discussed. The results showed that the maximum job length is bounded by a constant and algorithm finds a schedule whose length is within an additive constant of the optimal length.
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002
Liqun Chen, Matthias Enzmann, et al.
FC 2005
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989