Tamás Kis On the Complexity of Non-preemptive Shop Scheduling with Two Jobs. [Citation Graph (0, 0)][DBLP] Computing, 2002, v:69, n:1, pp:37-49 [Journal]
Tamás Kis A branch-and-cut algorithm for scheduling of projects with variable-intensity activities. [Citation Graph (0, 0)][DBLP] Math. Program., 2005, v:103, n:3, pp:515-539 [Journal]
Tamás Kis On the complexity of the car sequencing problem. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2004, v:32, n:4, pp:331-335 [Journal]
Tamás Kis Project scheduling: a review of recent books. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2005, v:33, n:1, pp:105-110 [Journal]
Tamás Kis, Erwin Pesch A review of exact solution methods for the non-preemptive multiprocessor flowshop problem. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:164, n:3, pp:592-608 [Journal]
Tamás Kis Job-shop scheduling with processing alternatives. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2003, v:151, n:2, pp:307-332 [Journal]