Conference paper
FPGA-based coprocessor for text string extraction
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
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.
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
B. Wagle
EJOR
Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002