 | 2012 |
| 25 |  | Tamás Kis,
András Kovács:
A cutting plane approach for integrated planning and scheduling.
Computers & OR 39(2): 320-327 (2012) |
| 2011 |
| 24 |  | András Kovács,
Tamás Kis:
Constraint programming approach to a bilevel scheduling problem.
Constraints 16(3): 317-340 (2011) |
| 23 |  | Márton Drótos,
Tamás Kis:
Resource leveling in a machine environment.
European Journal of Operational Research 212(1): 12-21 (2011) |
| 2010 |
| 22 |  | László Monostori,
Gábor Erdös,
Botond Kádár,
Tamás Kis,
András Kovács,
András Pfeiffer,
József Váncza:
Digital enterprise solution for integrated production planning and control.
Computers in Industry 61(2): 112-126 (2010) |
| 21 |  | Jacek Blazewicz,
Klaus Ecker,
Tamás Kis,
Chris N. Potts,
Michal Tanas,
J. Douglass Whitehead:
Scheduling of coupled tasks with unit processing times.
J. Scheduling 13(5): 453-461 (2010) |
| 20 |  | Tamás Kis,
Dominique de Werra,
Wieslaw Kubiak:
A projective algorithm for preemptive open shop scheduling with two multiprocessor groups.
Oper. Res. Lett. 38(2): 129-132 (2010) |
| 2009 |
| 19 |  | Márton Drótos,
Gábor Erdös,
Tamás Kis:
Computing lower and upper bounds for a large-scale industrial job shop scheduling problem.
European Journal of Operational Research 197(1): 296-306 (2009) |
| 18 |  | László Monostori,
Tamás Kis,
József Váncza,
Botond Kádár,
Gábor Erdös:
Real-time, cooperative enterprises for customised mass production.
Int. J. Computer Integrated Manufacturing 22(1): 55-68 (2009) |
| 17 |  | Tamás Kis:
Scheduling multiprocessor UET tasks of two sizes.
Theor. Comput. Sci. 410(47-49): 4864-4873 (2009) |
| 2008 |
| 16 |  | 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 |  | András Kéri,
Tamás Kis:
Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method.
CPAIOR 2007: 127-140 |
| 14 |  | 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 |  | 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 |  | 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 |  | András Kéri,
Tamás Kis:
Primal-Dual Combined with Constraint Propagation for Solving RCPSPWET.
OR 2005: 685-690 |
| 10 |  | 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 |  | Tamás Kis:
A branch-and-cut algorithm for scheduling of projects with variable-intensity activities.
Math. Program. 103(3): 515-539 (2005) |
| 8 |  | Tamás Kis:
Project scheduling: a review of recent books.
Oper. Res. Lett. 33(1): 105-110 (2005) |
| 2004 |
| 7 |  | András Kovács,
Tamás Kis:
Partitioning of trees for minimizing height and cardinality.
Inf. Process. Lett. 89(4): 181-185 (2004) |
| 6 |  | Tamás Kis:
On the complexity of the car sequencing problem.
Oper. Res. Lett. 32(4): 331-335 (2004) |
| 2003 |
| 5 |  | Tamás Kis,
Alain Hertz:
A Lower Bound for the Job Insertion Problem.
Discrete Applied Mathematics 128(2-3): 395-419 (2003) |
| 4 |  | Tamás Kis:
Job-shop scheduling with processing alternatives.
European Journal of Operational Research 151(2): 307-332 (2003) |
| 2002 |
| 3 |  | 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 |