Tamás Kis

According to our database, Tamás Kis authored at least 65 papers between 1996 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Facet separation for disjunctive constraints with network flow representation.

Péter Dobrovoczki, Tamás Kis

Ann. Oper. Res., October, 2024

Scheduling jobs to minimize a convex function of resource usage.

Tamás Kis, Evelin Szögi

Comput. Oper. Res., 2024

2023

An online joint replenishment problem combined with single machine scheduling.

Péter Györgyi, Tamás Kis, Tímea Tamási

J. Comb. Optim., July, 2023

Robust facility location in reverse logistics.

Péter Egri, Balázs Dávid, Tamás Kis, Miklós Krész

Ann. Oper. Res., May, 2023

Joint replenishment meets scheduling.

Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési

J. Sched., February, 2023

"Living in the Edge, Sailing Through the Cloud": Orchestrating Applications in the Edge to Cloud Computing Continuum.

Tamás Kis

Proceedings of the 8th International Conference on Complexity, 2023

2022

Ideal, non-extended formulations for disjunctive constraints admitting a network representation.

Tamás Kis, Markó Horváth

Math. Program., 2022

Strong cuts from compatibility relations for the Dial-a-Ride Problem.

Sunil Morapitiye, Tamás Kis

Discret. Appl. Math., 2022

New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints.

Péter Györgyi, Tamás Kis

Discret. Appl. Math., 2022

A project scheduling problem with periodically aggregated resource-constraints.

Pierre-Antoine Morin, Christian Artigues, Alain Haït, Tamás Kis, Frits C. R. Spieksma

Comput. Oper. Res., 2022

Assembly planning by disjunctive programming and geometrical reasoning.

Markó Horváth, Tamás Kis, András Kovács, Márk Fekula

Comput. Oper. Res., 2022

2021

Polyhedral Results and Branch-and-Cut for the Resource Loading Problem.

Guopeng Song, Tamás Kis, Roel Leus

INFORMS J. Comput., 2021

Suboptimal and conflict-free control of a fleet of AGVs to serve online requests.

Márton Drótos, Péter Györgyi, Markó Horváth, Tamás Kis

Comput. Ind. Eng., 2021

2020

A common approximation framework for early work, late work, and resource leveling problems.

Péter Györgyi, Tamás Kis

Eur. J. Oper. Res., 2020

Allocating raw materials to competing projects.

Péter Egri, Tamás Kis

Comput. Ind. Eng., 2020

Polyhedral results for position-based scheduling of chains on a single machine.

Markó Horváth, Tamás Kis

Ann. Oper. Res., 2020

2019

Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints.

Péter Györgyi, Tamás Kis

J. Sched., 2019

A probabilistic approach to pickup and delivery problems with time window uncertainty.

Péter Györgyi, Tamás Kis

Eur. J. Oper. Res., 2019

Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem.

Margaux Nattaf, Markó Horváth, Tamás Kis, Christian Artigues, Pierre Lopez

Discret. Appl. Math., 2019

A common approximation framework for the early work, the late work, and resource leveling problems with unit time jobs.

Péter Györgyi, Tamás Kis

CoRR, 2019

Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price.

Markó Horváth, Tamás Kis

Central Eur. J. Oper. Res., 2019

2018

Multi-criteria approximation schemes for the resource constrained shortest path problem.

Markó Horváth, Tamás Kis

Optim. Lett., 2018

Computational advances in combinatorial optimization.

Tibor Jordán, Tamás Kis, Silvano Martello

Discret. Appl. Math., 2018

Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut.

Péter Györgyi, Tamás Kis

Comput. Ind. Eng., 2018

2017

Approximation schemes for parallel machine scheduling with non-renewable resources.

Péter Györgyi, Tamás Kis

Eur. J. Oper. Res., 2017

2016

On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts.

Egon Balas, Tamás Kis

Math. Program., 2016

A Set of Successive Job Allocation Models in Distributed Computing Infrastructures.

Gábor Bacsó, Tamás Kis, Ádám Visegrádi, Attila Kertész, Zsolt Németh

J. Grid Comput., 2016

Solving resource constrained shortest path problems with LP-based methods.

Markó Horváth, Tamás Kis

Comput. Oper. Res., 2016

2015

Reductions between scheduling problems with non-renewable resources and knapsack problems.

Péter Györgyi, Tamás Kis

Theor. Comput. Sci., 2015

Approximability of total weighted completion time with resource consuming jobs.

Tamás Kis

Oper. Res. Lett., 2015

Intersection cuts - standard versus restricted.

Egon Balas, Tamás Kis

Discret. Optim., 2015

Approximability of scheduling problems with resource consuming jobs.

Péter Györgyi, Tamás Kis

Ann. Oper. Res., 2015

2014

Approximation schemes for single machine scheduling with non-renewable resource constraints.

Péter Györgyi, Tamás Kis

J. Sched., 2014

Lift-and-project for general two-term disjunctions.

Tamás Kis

Discret. Optim., 2014

2013

Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times.

Márton Drótos, Tamás Kis

J. Sched., 2013

Lifting Gomory cuts with bounded variables.

Gérard Cornuéjols, Tamás Kis, Marco Molinaro

Oper. Res. Lett., 2013

Combining Lift-and-Project and Reduce-and-Split.

Egon Balas, Gérard Cornuéjols, Tamás Kis, Giacomo Nannicini

INFORMS J. Comput., 2013

Exact solution approaches for bilevel lot-sizing.

Tamás Kis, András Kovács

Eur. J. Oper. Res., 2013

2012

On bilevel machine scheduling problems.

Tamás Kis, András Kovács

OR Spectr., 2012

A cutting plane approach for integrated planning and scheduling.

Tamás Kis, András Kovács

Comput. Oper. Res., 2012

2011

Resource leveling in a machine environment.

Márton Drótos, Tamás Kis

Eur. J. Oper. Res., 2011

Constraint programming approach to a bilevel scheduling problem.

András Kovács, Tamás Kis

Constraints An Int. J., 2011

2010

Scheduling of coupled tasks with unit processing times.

Jacek Blazewicz, Klaus Ecker, Tamás Kis, Chris N. Potts, Michal Tanas, J. Douglass Whitehead

J. Sched., 2010

A projective algorithm for preemptive open shop scheduling with two multiprocessor groups.

Tamás Kis, Dominique de Werra, Wieslaw Kubiak

Oper. Res. Lett., 2010

Digital enterprise solution for integrated production planning and control.

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

Comput. Ind., 2010

2009

Scheduling multiprocessor UET tasks of two sizes.

Tamás Kis

Theor. Comput. Sci., 2009

Real-time, cooperative enterprises for customised mass production.

László Monostori, Tamás Kis, József Váncza, Botond Kádár, Gábor Erdös

Int. J. Comput. Integr. Manuf., 2009

Computing lower and upper bounds for a large-scale industrial job shop scheduling problem.

Márton Drótos, Gábor Erdös, Tamás Kis

Eur. J. Oper. Res., 2009

2008

Preemptive open shop scheduling with multiprocessors: polynomial cases and applications.

Dominique de Werra, Tamás Kis, Wieslaw Kubiak

J. Sched., 2008

2007

Approximations and auctions for scheduling batches on related machines.

Tamás Kis, Richárd Kápolnai

Oper. Res. Lett., 2007

Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method.

András Kéri, Tamás Kis

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007

2006

Polyhedral results on single node variable upper-bound flow models with allowed configurations.

Tamás Kis

Discret. Optim., 2006

2005

Project scheduling: a review of recent books.

Tamás Kis

Oper. Res. Lett., 2005

A branch-and-cut algorithm for scheduling of projects with variable-intensity activities.

Tamás Kis

Math. Program., 2005

A review of exact solution methods for the non-preemptive multiprocessor flowshop problem.

Tamás Kis, Erwin Pesch

Eur. J. Oper. Res., 2005

Primal-Dual Combined with Constraint Propagation for Solving RCPSPWET.

András Kéri, Tamás Kis

Proceedings of the Operations Research Proceedings 2005, 2005

Proterv-II: An Integrated Production Planning and Scheduling System.

András Kovács, Péter Egri, Tamás Kis, József Váncza

Proceedings of the Principles and Practice of Constraint Programming, 2005

2004

On the complexity of the car sequencing problem.

Tamás Kis

Oper. Res. Lett., 2004

Partitioning of trees for minimizing height and cardinality.

András Kovács, Tamás Kis

Inf. Process. Lett., 2004

2003

Job-shop scheduling with processing alternatives.

Tamás Kis

Eur. J. Oper. Res., 2003

A Lower Bound for the Job Insertion Problem.

Tamás Kis, Alain Hertz

Discret. Appl. Math., 2003

2002

On the Complexity of Non-preemptive Shop Scheduling with Two Jobs.

Tamás Kis

Computing, 2002

2001

A note on the complexity of scheduling coupled tasks on a single processor.

Jacek Blazewicz, Klaus H. Ecker, Tamás Kis, Michal Tanas

J. Braz. Comput. Soc., 2001

2000

A Petri net model for integrated process and job shop production planning.

Tamás Kis, Dimitris Kiritsis, Paul C. Xirouchakis, Klaus-Peter Neuendorf

J. Intell. Manuf., 2000

1996

Controlling Distributed Manufacturing Systems by a Market Mechanism.

Tamás Kis, József Váncza, András Márkus

Proceedings of the 12th European Conference on Artificial Intelligence, 1996