| 2008 |
|---|
| 16 | EE | Dominique de Werra,
Tamás Kis,
Wieslaw Kubiak:
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications.
J. Scheduling 11(1): 75-83 (2008) |
| 2007 |
|---|
| 15 | EE | András Kéri,
Tamás Kis:
Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method.
CPAIOR 2007: 127-140 |
| 14 | EE | Tamás Kis,
Richárd Kápolnai:
Approximations and auctions for scheduling batches on related machines.
Oper. Res. Lett. 35(1): 61-68 (2007) |
| 2006 |
|---|
| 13 | EE | Tamás Kis:
Polyhedral results on single node variable upper-bound flow models with allowed configurations.
Discrete Optimization 3(4): 341-353 (2006) |
| 2005 |
|---|
| 12 | EE | András Kovács,
Péter Egri,
Tamás Kis,
József Váncza:
Proterv-II: An Integrated Production Planning and Scheduling System.
CP 2005: 880-880 |
| 11 | EE | András Kéri,
Tamás Kis:
Primal-Dual Combined with Constraint Propagation for Solving RCPSPWET.
OR 2005: 685-690 |
| 10 | EE | Tamás Kis,
Erwin Pesch:
A review of exact solution methods for the non-preemptive multiprocessor flowshop problem.
European Journal of Operational Research 164(3): 592-608 (2005) |
| 9 | EE | Tamás Kis:
A branch-and-cut algorithm for scheduling of projects with variable-intensity activities.
Math. Program. 103(3): 515-539 (2005) |
| 8 | EE | Tamás Kis:
Project scheduling: a review of recent books.
Oper. Res. Lett. 33(1): 105-110 (2005) |
| 2004 |
|---|
| 7 | EE | András Kovács,
Tamás Kis:
Partitioning of trees for minimizing height and cardinality.
Inf. Process. Lett. 89(4): 181-185 (2004) |
| 6 | EE | Tamás Kis:
On the complexity of the car sequencing problem.
Oper. Res. Lett. 32(4): 331-335 (2004) |
| 2003 |
|---|
| 5 | EE | Tamás Kis,
Alain Hertz:
A Lower Bound for the Job Insertion Problem.
Discrete Applied Mathematics 128(2-3): 395-419 (2003) |
| 4 | EE | Tamás Kis:
Job-shop scheduling with processing alternatives.
European Journal of Operational Research 151(2): 307-332 (2003) |
| 2002 |
|---|
| 3 | EE | Tamás Kis:
On the Complexity of Non-preemptive Shop Scheduling with Two Jobs.
Computing 69(1): 37-49 (2002) |
| 2001 |
|---|
| 2 | | Jacek Blazewicz,
Klaus H. Ecker,
Tamás Kis,
Michal Tanas:
A note on the complexity of scheduling coupled tasks on a single processor.
J. Braz. Comp. Soc. 7(3): 23-26 (2001) |
| 1996 |
|---|
| 1 | | Tamás Kis,
József Váncza,
András Márkus:
Controlling Distributed Manufacturing Systems by a Market Mechanism.
ECAI 1996: 534-538 |
