Tamás Kis

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 30

Top Topics

Scheduling Problem

Resource Constrained

Maximum Lateness

Top Venues

Comput. Oper. Res.

Discret. Appl. Math.

Publications

Tamás Kis, Evelin Szögi
Scheduling jobs to minimize a convex function of resource usage. Comput. Oper. Res. 169 (2024)
Tamás Kis
"Living in the Edge, Sailing Through the Cloud": Orchestrating Applications in the Edge to Cloud Computing Continuum. COMPLEXIS (2023)
Péter Györgyi, Tamás Kis, Tímea Tamási
An online joint replenishment problem combined with single machine scheduling. J. Comb. Optim. 45 (5) (2023)
Péter Egri, Balázs Dávid, Tamás Kis, Miklós Krész
Robust facility location in reverse logistics. Ann. Oper. Res. 324 (1) (2023)
Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési
Joint replenishment meets scheduling. J. Sched. 26 (1) (2023)
Evelin Szögi, Tamás Kis
Scheduling Jobs to Minimize a Convex Function of Resource Usage. FedCSIS (2023)
Markó Horváth, Tamás Kis, András Kovács, Márk Fekula
Assembly planning by disjunctive programming and geometrical reasoning. Comput. Oper. Res. 138 (2022)
Pierre-Antoine Morin, Christian Artigues, Alain Haït, Tamás Kis, Frits C. R. Spieksma
A project scheduling problem with periodically aggregated resource-constraints. Comput. Oper. Res. 141 (2022)
Péter Györgyi, Tamás Kis, Tímea Tamási
An online joint replenishment problem combined with single machine scheduling. CoRR (2022)
Tamás Kis, Markó Horváth
Ideal, non-extended formulations for disjunctive constraints admitting a network representation. Math. Program. 194 (1) (2022)
Sunil Morapitiye, Tamás Kis
Strong cuts from compatibility relations for the Dial-a-Ride Problem. Discret. Appl. Math. 309 (2022)
Péter Györgyi, Tamás Kis
New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints. Discret. Appl. Math. 311 (2022)
Márton Drótos, Péter Györgyi, Markó Horváth, Tamás Kis
Suboptimal and conflict-free control of a fleet of AGVs to serve online requests. Comput. Ind. Eng. 152 (2021)
Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési
Joint replenishment meets scheduling. CoRR (2021)
Guopeng Song, Tamás Kis, Roel Leus
Polyhedral Results and Branch-and-Cut for the Resource Loading Problem. INFORMS J. Comput. 33 (1) (2021)
Péter Egri, Tamás Kis
Allocating raw materials to competing projects. Comput. Ind. Eng. 143 (2020)
Markó Horváth, Tamás Kis
Polyhedral results for position-based scheduling of chains on a single machine. Ann. Oper. Res. 284 (1) (2020)
Péter Györgyi, Tamás Kis
A common approximation framework for early work, late work, and resource leveling problems. Eur. J. Oper. Res. 286 (1) (2020)
Péter Györgyi, Tamás Kis
A common approximation framework for the early work, the late work, and resource leveling problems with unit time jobs. CoRR (2019)
Markó Horváth, Tamás Kis
Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price. Central Eur. J. Oper. Res. 27 (1) (2019)
Margaux Nattaf, Markó Horváth, Tamás Kis, Christian Artigues, Pierre Lopez
Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem. Discret. Appl. Math. 258 (2019)
Péter Györgyi, Tamás Kis
A probabilistic approach to pickup and delivery problems with time window uncertainty. Eur. J. Oper. Res. 274 (3) (2019)
Péter Györgyi, Tamás Kis
Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints. J. Sched. 22 (6) (2019)
Tibor Jordán, Tamás Kis, Silvano Martello
Computational advances in combinatorial optimization. Discret. Appl. Math. 242 (2018)
Péter Györgyi, Tamás Kis
Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut. Comput. Ind. Eng. 115 (2018)
Markó Horváth, Tamás Kis
Multi-criteria approximation schemes for the resource constrained shortest path problem. Optim. Lett. 12 (3) (2018)
Péter Györgyi, Tamás Kis
Approximation schemes for parallel machine scheduling with non-renewable resources. Eur. J. Oper. Res. 258 (1) (2017)
Gábor Bacsó, Tamás Kis, Ádám Visegrádi, Attila Kertész, Zsolt Németh
A Set of Successive Job Allocation Models in Distributed Computing Infrastructures. J. Grid Comput. 14 (2) (2016)
Egon Balas, Tamás Kis
On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts. Math. Program. 160 (1-2) (2016)
Markó Horváth, Tamás Kis
Solving resource constrained shortest path problems with LP-based methods. Comput. Oper. Res. 73 (2016)
Péter Györgyi, Tamás Kis
Approximability of scheduling problems with resource consuming jobs. Ann. Oper. Res. 235 (1) (2015)
Péter Györgyi, Tamás Kis
Reductions between scheduling problems with non-renewable resources and knapsack problems. Theor. Comput. Sci. 565 (2015)
Tamás Kis
Approximability of total weighted completion time with resource consuming jobs. Oper. Res. Lett. 43 (6) (2015)
Egon Balas, Tamás Kis
Intersection cuts - standard versus restricted. Discret. Optim. 18 (2015)
Péter Györgyi, Tamás Kis
Approximation schemes for single machine scheduling with non-renewable resource constraints. J. Sched. 17 (2) (2014)
Tamás Kis
Lift-and-project for general two-term disjunctions. Discret. Optim. 12 (2014)
Márton Drótos, Tamás Kis
Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times. J. Sched. 16 (3) (2013)
Gérard Cornuéjols, Tamás Kis, Marco Molinaro
Lifting Gomory cuts with bounded variables. Oper. Res. Lett. 41 (2) (2013)
Tamás Kis, András Kovács
Exact solution approaches for bilevel lot-sizing. Eur. J. Oper. Res. 226 (2) (2013)
Egon Balas, Gérard Cornuéjols, Tamás Kis, Giacomo Nannicini
Combining Lift-and-Project and Reduce-and-Split. INFORMS J. Comput. 25 (3) (2013)
Tamás Kis, András Kovács
On bilevel machine scheduling problems. OR Spectr. 34 (1) (2012)
Tamás Kis, András Kovács
A cutting plane approach for integrated planning and scheduling. Comput. Oper. Res. 39 (2) (2012)
Márton Drótos, Tamás Kis
Resource leveling in a machine environment. Eur. J. Oper. Res. 212 (1) (2011)
András Kovács, Tamás Kis
Constraint programming approach to a bilevel scheduling problem. Constraints An Int. J. 16 (3) (2011)
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. Comput. Ind. 61 (2) (2010)
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) (2010)
Jacek Blazewicz, Klaus Ecker, Tamás Kis, Chris N. Potts, Michal Tanas, J. Douglass Whitehead
Scheduling of coupled tasks with unit processing times. J. Sched. 13 (5) (2010)
Tamás Kis
Scheduling multiprocessor UET tasks of two sizes. Theor. Comput. Sci. 410 (47-49) (2009)
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. Eur. J. Oper. Res. 197 (1) (2009)
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. Comput. Integr. Manuf. 22 (1) (2009)
Dominique de Werra, Tamás Kis, Wieslaw Kubiak
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications. J. Sched. 11 (1) (2008)
András Kéri, Tamás Kis
Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method. CPAIOR (2007)
Tamás Kis, Richárd Kápolnai
Approximations and auctions for scheduling batches on related machines. Oper. Res. Lett. 35 (1) (2007)
Tamás Kis
Polyhedral results on single node variable upper-bound flow models with allowed configurations. Discret. Optim. 3 (4) (2006)
András Kéri, Tamás Kis
Primal-Dual Combined with Constraint Propagation for Solving RCPSPWET. OR (2005)
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)
Tamás Kis
A branch-and-cut algorithm for scheduling of projects with variable-intensity activities. Math. Program. 103 (3) (2005)
Tamás Kis
Project scheduling: a review of recent books. Oper. Res. Lett. 33 (1) (2005)
Tamás Kis, Erwin Pesch
A review of exact solution methods for the non-preemptive multiprocessor flowshop problem. Eur. J. Oper. Res. 164 (3) (2005)
András Kovács, Tamás Kis
Partitioning of trees for minimizing height and cardinality. Inf. Process. Lett. 89 (4) (2004)
Tamás Kis
On the complexity of the car sequencing problem. Oper. Res. Lett. 32 (4) (2004)
Tamás Kis, Alain Hertz
A Lower Bound for the Job Insertion Problem. Discret. Appl. Math. 128 (2-3) (2003)
Tamás Kis
Job-shop scheduling with processing alternatives. Eur. J. Oper. Res. 151 (2) (2003)
Tamás Kis
On the Complexity of Non-preemptive Shop Scheduling with Two Jobs. Computing 69 (1) (2002)
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. Comput. Soc. 7 (3) (2001)
Tamás Kis, Dimitris Kiritsis, Paul C. Xirouchakis, Klaus-Peter Neuendorf
A Petri net model for integrated process and job shop production planning. J. Intell. Manuf. 11 (2) (2000)
Tamás Kis, József Váncza, András Márkus
Controlling Distributed Manufacturing Systems by a Market Mechanism. ECAI (1996)