Papers in reviewed journals
1. Márkus, A., Kis, T., Váncza,
J., Monostori, L. (1996). A Market Approach to Holonic Manufacturing. Annals of the CIRP, 45/1, 433—436.
2. Kis, T., Kiritsis, D., Xirouchakis,
P., Neuendorf, K.-P. (2000). A Petri net model for
integrated process and job shop production planning. Journal of Intelligent
Manufacturing, 191—207.
3. Erdős, G., Kis, T., Xirouchakis
P. (2001). Modelling and evaluating product end-of-life options. International
Journal of Production Research 39/6, 1203—1220.
4. Blazewicz, J., Ecker, K., Kis, T., Tanas, M. (2002). A note on
the complexity of scheduling coupled tasks on a single processor, Journal of
the Brazilian Computer Society 7/3.
5. Kis, T. (2002). On the complexity of non-preemptive shop scheduling with two
jobs, Computing 69, 37— 49.
6. Kis, T., Hertz, A. (2003). A lower bound for the job insertion problem.
Discrete Applied Mathematics 128/2-3, 395—419.
7. Márkus, A., Váncza, J.,
Kis, T., Kovács, A. (2003). Project scheduling
approach for production planning, Annals of the CIRP, 52/1.
8. Kis T. (2003). Job-shop scheduling with processing alternatives,
European Journal of Operational Research 151/2, 307—332.
9. Kis, T. (2004), On the complexity of the car
sequencing problem, Operations Research Letters 32/4, 331-335.
10. Kovács, A., Kis, T. (2004), Partitioning of trees
for minimizing height and cardinality, Information Processing Letters 89,
181-185.
11. Kis, T., Pesch E., (2005), A review of exact
solution methods for the non-preemptive multiprocessor flowshop
problem, European Journal of Operational Research, 164, 592-608.
12. Váncza, J., Kis, T., Kovács,
A., (2004), Aggregation - the Key to integrating production planning and
Scheduling, Annals of the CIRP, 53/1/2004, 377-380.
13. Kis, T. (2005), Project
scheduling: a review of recent books, Operations Research Letters, 33, 105-110.
14. Kis, T. (2005). A branch-and-cut algorithm for scheduling of projects with
variable intensity activities, Mathematical Programming, 103, 515-539 .
15. Kis T.
(2006). Polyhedral Results on the
Single Node Variable Upper-Bound Flow Model with Allowed Configurations,
Discrete Optimization, 3: 341-353.
16. Kis, T., R. Kápolnai (2007). Approximations
and auctions for scheduling batches on related machines, Operations Research
Letters, 35: 61-68.
17. de Werra, D., Kis, T., Kubiak, W. (2008). Preemptive open shop scheduling with multiprocessors: polynomial cases and applications, Journal of Scheduling, 11: 75-83.
18. Drótos, M., Erdős, G., Kis, T. (2009). Computing lower and upper bounds for a large-scale industrial job shop scheduling problem, European Journal of Operational Researcher, 197: 296–306.
19. Kis, T., Scheduling multiprocessor UET tasks of two sizes, Theoretical Computer Science, 410, 4864-4873, 2009.
20. Monostori, L., Kis, T., Vancza, J., Kadar, B., Erdős, G. (2009): Real-time, cooperative enterprises for customised mass production, International Journal of Computer Integrated Manufacturing, 22 (1), 55-68.
21. Monostori, L., Erdos, G., Kádár, B., Kis, T., Kovács, A., Pfeiffer, A., Váncza, J. (2010): Digital enterprise solution for integrated production planning and control, Computers in Industry, 61 (2), 112-126.
22. Kis, T., de Werra, D., Kubiak, W. (2010): A projective algorithm for preemptive open shop scheduling with two multiprocessor groups, Operations Research Letters, 38 (2), 129-132.
23. Blazewicz, J., Ecker, K., Kis, T.,
Potts, C.N., Tanas, M., Whitehead, J. (2010): Scheduling
of coupled tasks with unit processing times, Journal of Scheduling, article in press.
24. Kovács, A., Kis, T. (2011): Constraint programming approach to a bilevel scheduling problem, Journal of Constraints, vol 16, pp. 317-340, pdf
25. Kovács, A., Egri, P., Kis, T., Váncza, J. (2011): Inventory control in supply chains: A comparative analysis of fundamental models, International Journal of Production Economics, accepted, pdf
26. Kis, T., Kovács A. (2012): On bilevel machine scheduling problems, OR Spectrum, 34, 43-68, pdf
27. Kis, T., Kovács, A. (2012): A cutting plane approach for integrated planning and scheduling, Computers & Operations Research, vol. 39, pp. 320-327, pdf
28. Balas, E., Cornuejols, G., Kis, T., Nannicini G. (2012): Combining lift-and-project and reduce-and-split, INFORMS Journal on Computing, accepted.
Book chapters
1. Kis, T., Váncza, J. (1995). Computational
Complexity of Manufacturing Process Planning. In: Ghallab,
M., Milani, A. (eds.), Advances in AI Planning, IOS
Press, 299—311.
2. Kis, T., Xirouchakis, P. (1998). Concepts for
Integrating Process Planning and Production Scheduling. In: Tzafestas,
S.G. (ed.), Advances in manufacturing: decision, control and information
technology. Springer-Verlag London, 1—12.
3. Kis, T. (1999). Haladó kereső
algoritmusok, In: Futó, I.
(ed.), Mesterséges Intelligencia,
Aula,
4. Kis T. (2006). RCPS with
variable intensity activities and feeding precedence constraints, In: Józefowska J. and Wegalrz J.,
Perspectives in Modern Project Scheduling, Springer,
Conference proceedings
1. Kis, T., Váncza J., Computational Complexity of
Manufacturing Process Planning. In: Ghallab M., (ed.)
Preprints of the 3rd European Workshop on Planning, EWSP'95,
2. Kis, T., Váncza, J., Márkus,
A., (1996). Controlling Distributed Manufacturing Systems by a Market Mechanism.
In: Proceedings of the 12th European Conference on Artificial Intelligence,
3. Solot, P., Hertz, A., Kis, T., L. Willmann, (1999). Capacity optimization of multipurpose
plants using batch simulation and evolutionary algorithms. In: Proceedings of
the Interkama Chemputers
Europe 5 Conference,
4. Kis, T., (2000). The job insertion problem in job shop scheduling, In:
Proceedings of the International Workshop Discrete Optimization Methods in
Scheduling and Computer-Aided Design,
5. Kis, T., (2001). Solving the job insertion problem by branch-and-bound. In:
Proceedings of the European Chapter on Combinatorial Optimization, ECCO XIV,
Bonn, May 31-June 2, 2001.
6. Kis, T., (2001). Solving the job insertion problem by branch-and-bound. In:
Proceedings of the Fifth Workshop on Models and Algorithms for Planning and
Scheduling Problems, MAPSP'01 Models
and Algorithms for Planning and Scheduling Problems, Aussois, June 17-22, 2001.
7. Kis, T., (2003). A branch-and-cut approach for scheduling of projects with
variable intensity activities, In: Proceedings of the Sixth Workshop on Models
and Algorithms for Planning and Scheduling Problems, MAPSP'03, Aussois, March 30-April 04, 2003.
8. Kis, T., (2003). Polyhedral results and branch-and-cut for scheduling of
projects with variable intensity activities, In: Proceedings of the XVIII
International Symposium on Mathemtical Programming,
ISMP XVIII,
9. Kis, T., (2004). Scheduling of variable intensity activities connected by
feeding precedence constraints, Dagstuhl Seminar on
Scheduling in Computer and Manufacturing Systems,
Dagstuhl, 31.05-04.06.2004.
10. Kis, T., (2004). Polyhedral
Results on the Single Node Variable Upper-Bound Flow Model with Allowed
Configurations, In: Proceedings of the
11. Kis, T., Kápolnai
R. (2005), A 2-approximation algorithm and a truthful mechanism for scheduling batches
on machines running at different speeds, MAPSP’05, Siena, Italy, June 6-10,
2005.
12. Kéri,
A., Kis, T. (2005), Primal-dual combined with constraint propagation for
solving RCPSPWET, In: Kendall, G., Lei, L., Pinedo,
M. (eds), Proc of 2nd
Multidisciplinary International Conference on Scheduling: Theory and
Applications,
13. Kis, T., Drótos, M., Erdos, G, Kovacs, A.
(2006). The interval flowshop model, PMS
2006. Tenth international workshop on project management and scheduling.
14. Keri A, Kis T. (2007). Computing tight time windows for RCPSPWET with the primal-dual method, LNCS 4510, 2007, pp. 127-140.
15. Drótos, M., Erdős, G., Kis, T., A lower bound and a tabu search algorithm for scheduling batches in a
proportional job shop, MAPSP’07, Koc University,
Istanbul, Turkey, 2007.
16. Kis, T. (2008). Scheduling UET multiprocessor tasks of
two sizes, VOCAL 2008, Veszprém, Hungary, 2008.
17. Drótos M., Kis T. (2008).
Minimize overtime in a parallel machine environment, VOCAL 2008,
18. Kis, T., Kovacs A. (2009). On bilevel machine sceheduling problems, MAPSP’09, Abbey Rolduc, Kerkrade, The Netherlands, June 29- July 03, 2009.
19. Kovács András, Kis Tamás (2009): Constraint Programming Approach to a Bilevel Scheduling Problem, ICAPS 2009 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems.
1. GÉPÜTEMEZÉS KIEGÉSZÍTŐ ERŐFORRÁSOKKAL, pdf