Tamás Kis

72 papers A 2B 1C 2Journal 66Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
On recent computational results for a dynamic pickup and delivery problem.
Memetic Comput.
Markó Horváth, Tamás Kis
2025 J jnl
On variants of a load-balancing problem with unit-load jobs.
J. Sched.
Péter Györgyi, Tamás Kis, Evelin Szögi
2025 J jnl
Reactive scheduling of uncertain jobs with maximum time lags.
Eur. J. Oper. Res.
Péter Györgyi, Tamás Kis, Evelin Szögi
2025 J jnl
Scheduling with assignable due dates, two competing agents and late work related criteria.
Comput. Oper. Res.
Shi-Sheng Li, Yao-Wen Sang, Ren-Xia Chen, Malgorzata Sterna, Tamás Kis
2024 J jnl
Facet separation for disjunctive constraints with network flow representation.
Ann. Oper. Res.
Péter Dobrovoczki, Tamás Kis
2024 J jnl
Scheduling jobs to minimize a convex function of resource usage.
Comput. Oper. Res.
Tamás Kis, Evelin Szögi
2023 C conf
"Living in the Edge, Sailing Through the Cloud": Orchestrating Applications in the Edge to Cloud Computing Continuum.
COMPLEXIS
Tamás Kis
2023 J jnl
An online joint replenishment problem combined with single machine scheduling.
J. Comb. Optim.
Péter Györgyi, Tamás Kis, Tímea Tamási
2023 J jnl
Joint replenishment meets scheduling.
J. Sched.
Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési
2023 J jnl
Robust facility location in reverse logistics.
Ann. Oper. Res.
Péter Egri, Balázs Dávid, Tamás Kis, Miklós Krész
2023 C conf
Scheduling Jobs to Minimize a Convex Function of Resource Usage.
FedCSIS
Evelin Szögi, Tamás Kis
2022 J jnl
A project scheduling problem with periodically aggregated resource-constraints.
Comput. Oper. Res.
Pierre-Antoine Morin, Christian Artigues, Alain Haït, Tamás Kis, Frits C. R. Spieksma
2022 J jnl
An online joint replenishment problem combined with single machine scheduling.
CoRR
Péter Györgyi, Tamás Kis, Tímea Tamási
2022 J jnl
Assembly planning by disjunctive programming and geometrical reasoning.
Comput. Oper. Res.
Markó Horváth, Tamás Kis, András Kovács, Márk Fekula
2022 J jnl
Ideal, non-extended formulations for disjunctive constraints admitting a network representation.
Math. Program.
Tamás Kis, Markó Horváth
2022 J jnl
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.
Péter Györgyi, Tamás Kis
2022 J jnl
Strong cuts from compatibility relations for the Dial-a-Ride Problem.
Discret. Appl. Math.
Sunil Morapitiye, Tamás Kis
2021 J jnl
Joint replenishment meets scheduling.
CoRR
Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési
2021 J jnl
Polyhedral Results and Branch-and-Cut for the Resource Loading Problem.
INFORMS J. Comput.
Guopeng Song, Tamás Kis, Roel Leus
2021 J jnl
Suboptimal and conflict-free control of a fleet of AGVs to serve online requests.
Comput. Ind. Eng.
Márton Drótos, Péter Györgyi, Markó Horváth, Tamás Kis
2020 J jnl
A common approximation framework for early work, late work, and resource leveling problems.
Eur. J. Oper. Res.
Péter Györgyi, Tamás Kis
2020 J jnl
Allocating raw materials to competing projects.
Comput. Ind. Eng.
Péter Egri, Tamás Kis
2020 J jnl
Polyhedral results for position-based scheduling of chains on a single machine.
Ann. Oper. Res.
Markó Horváth, Tamás Kis
2019 J jnl
A common approximation framework for the early work, the late work, and resource leveling problems with unit time jobs.
CoRR
Péter Györgyi, Tamás Kis
2019 J jnl
A probabilistic approach to pickup and delivery problems with time window uncertainty.
Eur. J. Oper. Res.
Péter Györgyi, Tamás Kis
2019 J jnl
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.
Markó Horváth, Tamás Kis
2019 J jnl
Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints.
J. Sched.
Péter Györgyi, Tamás Kis
2019 J jnl
Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem.
Discret. Appl. Math.
Margaux Nattaf, Markó Horváth, Tamás Kis, Christian Artigues, Pierre Lopez
2018 J jnl
Computational advances in combinatorial optimization.
Discret. Appl. Math.
Tibor Jordán, Tamás Kis, Silvano Martello
2018 J jnl
Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut.
Comput. Ind. Eng.
Péter Györgyi, Tamás Kis
2018 J jnl
Multi-criteria approximation schemes for the resource constrained shortest path problem.
Optim. Lett.
Markó Horváth, Tamás Kis
2017 J jnl
Approximation schemes for parallel machine scheduling with non-renewable resources.
Eur. J. Oper. Res.
Péter Györgyi, Tamás Kis
2016 J jnl
A Set of Successive Job Allocation Models in Distributed Computing Infrastructures.
J. Grid Comput.
Gábor Bacsó, Tamás Kis, Ádám Visegrádi, Attila Kertész, Zsolt Németh
2016 J jnl
On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts.
Math. Program.
Egon Balas, Tamás Kis
2016 J jnl
Solving resource constrained shortest path problems with LP-based methods.
Comput. Oper. Res.
Markó Horváth, Tamás Kis
2015 J jnl
Approximability of scheduling problems with resource consuming jobs.
Ann. Oper. Res.
Péter Györgyi, Tamás Kis
2015 J jnl
Approximability of total weighted completion time with resource consuming jobs.
Oper. Res. Lett.
Tamás Kis
2015 J jnl
Intersection cuts - standard versus restricted.
Discret. Optim.
Egon Balas, Tamás Kis
2015 J jnl
Reductions between scheduling problems with non-renewable resources and knapsack problems.
Theor. Comput. Sci.
Péter Györgyi, Tamás Kis
2014 J jnl
Approximation schemes for single machine scheduling with non-renewable resource constraints.
J. Sched.
Péter Györgyi, Tamás Kis
2014 J jnl
Lift-and-project for general two-term disjunctions.
Discret. Optim.
Tamás Kis
2013 J jnl
Combining Lift-and-Project and Reduce-and-Split.
INFORMS J. Comput.
Egon Balas, Gérard Cornuéjols, Tamás Kis, Giacomo Nannicini
2013 J jnl
Exact solution approaches for bilevel lot-sizing.
Eur. J. Oper. Res.
Tamás Kis, András Kovács
2013 J jnl
Lifting Gomory cuts with bounded variables.
Oper. Res. Lett.
Gérard Cornuéjols, Tamás Kis, Marco Molinaro
2013 J jnl
Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times.
J. Sched.
Márton Drótos, Tamás Kis
2012 J jnl
A cutting plane approach for integrated planning and scheduling.
Comput. Oper. Res.
Tamás Kis, András Kovács
2012 J jnl
On bilevel machine scheduling problems.
OR Spectr.
Tamás Kis, András Kovács
2011 J jnl
Constraint programming approach to a bilevel scheduling problem.
Constraints An Int. J.
András Kovács, Tamás Kis
2011 J jnl
Resource leveling in a machine environment.
Eur. J. Oper. Res.
Márton Drótos, Tamás Kis
2010 J jnl
A projective algorithm for preemptive open shop scheduling with two multiprocessor groups.
Oper. Res. Lett.
Tamás Kis, Dominique de Werra, Wieslaw Kubiak
2010 J jnl
Digital enterprise solution for integrated production planning and control.
Comput. Ind.
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
2010 J jnl
Scheduling of coupled tasks with unit processing times.
J. Sched.
Jacek Blazewicz, Klaus Ecker, Tamás Kis, Chris N. Potts, Michal Tanas, J. Douglass Whitehead
2009 J jnl
Computing lower and upper bounds for a large-scale industrial job shop scheduling problem.
Eur. J. Oper. Res.
Márton Drótos, Gábor Erdös, Tamás Kis
2009 J jnl
Real-time, cooperative enterprises for customised mass production.
Int. J. Comput. Integr. Manuf.
László Monostori, Tamás Kis, József Váncza, Botond Kádár, Gábor Erdös
2009 J jnl
Scheduling multiprocessor UET tasks of two sizes.
Theor. Comput. Sci.
Tamás Kis
2008 J jnl
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications.
J. Sched.
Dominique de Werra, Tamás Kis, Wieslaw Kubiak
2007 J jnl
Approximations and auctions for scheduling batches on related machines.
Oper. Res. Lett.
Tamás Kis, Richárd Kápolnai
2007 B conf
Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method.
CPAIOR
András Kéri, Tamás Kis
2006 J jnl
Polyhedral results on single node variable upper-bound flow models with allowed configurations.
Discret. Optim.
Tamás Kis
2005 J jnl
A branch-and-cut algorithm for scheduling of projects with variable-intensity activities.
Math. Program.
Tamás Kis
2005 J jnl
A review of exact solution methods for the non-preemptive multiprocessor flowshop problem.
Eur. J. Oper. Res.
Tamás Kis, Erwin Pesch
2005 — conf
Primal-Dual Combined with Constraint Propagation for Solving RCPSPWET.
OR
András Kéri, Tamás Kis
2005 J jnl
Project scheduling: a review of recent books.
Oper. Res. Lett.
Tamás Kis
2005 A conf
Proterv-II: An Integrated Production Planning and Scheduling System.
CP
András Kovács, Péter Egri, Tamás Kis, József Váncza
2004 J jnl
On the complexity of the car sequencing problem.
Oper. Res. Lett.
Tamás Kis
2004 J jnl
Partitioning of trees for minimizing height and cardinality.
Inf. Process. Lett.
András Kovács, Tamás Kis
2003 J jnl
A Lower Bound for the Job Insertion Problem.
Discret. Appl. Math.
Tamás Kis, Alain Hertz
2003 J jnl
Job-shop scheduling with processing alternatives.
Eur. J. Oper. Res.
Tamás Kis
2002 J jnl
On the Complexity of Non-preemptive Shop Scheduling with Two Jobs.
Computing
Tamás Kis
2001 J jnl
A note on the complexity of scheduling coupled tasks on a single processor.
J. Braz. Comput. Soc.
Jacek Blazewicz, Klaus H. Ecker, Tamás Kis, Michal Tanas
2000 J jnl
A Petri net model for integrated process and job shop production planning.
J. Intell. Manuf.
Tamás Kis, Dimitris Kiritsis, Paul C. Xirouchakis, Klaus-Peter Neuendorf
1996 A conf
Controlling Distributed Manufacturing Systems by a Market Mechanism.
ECAI
Tamás Kis, József Váncza, András Márkus