default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTamás Kis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j59]Péter Dobrovoczki, Tamás Kis
:
Facet separation for disjunctive constraints with network flow representation. Ann. Oper. Res. 341(2): 825-857 (2024)- [j58]Tamás Kis, Evelin Szögi:
Scheduling jobs to minimize a convex function of resource usage. Comput. Oper. Res. 169: 106748 (2024) - 2023
- [j57]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): 163-188 (2023) - [j56]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): 134 (2023) - [j55]Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési:
Joint replenishment meets scheduling. J. Sched. 26(1): 77-94 (2023) - [c6]Tamás Kis:
"Living in the Edge, Sailing Through the Cloud": Orchestrating Applications in the Edge to Cloud Computing Continuum. COMPLEXIS 2023: 5-6 - [c5]Evelin Szögi, Tamás Kis:
Scheduling Jobs to Minimize a Convex Function of Resource Usage. FedCSIS 2023: 791-799 - 2022
- [j54]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: 105603 (2022) - [j53]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: 105688 (2022) - [j52]Sunil Morapitiye, Tamás Kis:
Strong cuts from compatibility relations for the Dial-a-Ride Problem. Discret. Appl. Math. 309: 240-257 (2022) - [j51]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: 97-109 (2022) - [j50]Tamás Kis, Markó Horváth:
Ideal, non-extended formulations for disjunctive constraints admitting a network representation. Math. Program. 194(1): 831-869 (2022) - [i3]Péter Györgyi, Tamás Kis, Tímea Tamási:
An online joint replenishment problem combined with single machine scheduling. CoRR abs/2208.02748 (2022) - 2021
- [j49]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: 106999 (2021) - [j48]Guopeng Song, Tamás Kis, Roel Leus:
Polyhedral Results and Branch-and-Cut for the Resource Loading Problem. INFORMS J. Comput. 33(1): 105-119 (2021) - [i2]Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési:
Joint replenishment meets scheduling. CoRR abs/2104.09178 (2021) - 2020
- [j47]Markó Horváth, Tamás Kis:
Polyhedral results for position-based scheduling of chains on a single machine. Ann. Oper. Res. 284(1): 283-322 (2020) - [j46]Péter Egri, Tamás Kis:
Allocating raw materials to competing projects. Comput. Ind. Eng. 143: 106386 (2020) - [j45]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): 129-137 (2020)
2010 – 2019
- 2019
- [j44]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): 39-67 (2019) - [j43]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: 188-203 (2019) - [j42]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): 909-923 (2019) - [j41]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): 623-634 (2019) - [i1]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 abs/1909.11086 (2019) - 2018
- [j40]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: 220-225 (2018) - [j39]Tibor Jordán, Tamás Kis, Silvano Martello:
Computational advances in combinatorial optimization. Discret. Appl. Math. 242: 1-3 (2018) - [j38]Markó Horváth, Tamás Kis:
Multi-criteria approximation schemes for the resource constrained shortest path problem. Optim. Lett. 12(3): 475-483 (2018) - 2017
- [j37]Péter Györgyi, Tamás Kis:
Approximation schemes for parallel machine scheduling with non-renewable resources. Eur. J. Oper. Res. 258(1): 113-123 (2017) - 2016
- [j36]Markó Horváth, Tamás Kis:
Solving resource constrained shortest path problems with LP-based methods. Comput. Oper. Res. 73: 150-164 (2016) - [j35]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): 347-358 (2016) - [j34]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): 85-114 (2016) - 2015
- [j33]Péter Györgyi, Tamás Kis:
Approximability of scheduling problems with resource consuming jobs. Ann. Oper. Res. 235(1): 319-336 (2015) - [j32]Egon Balas, Tamás Kis:
Intersection cuts - standard versus restricted. Discret. Optim. 18: 189-192 (2015) - [j31]Tamás Kis:
Approximability of total weighted completion time with resource consuming jobs. Oper. Res. Lett. 43(6): 595-598 (2015) - [j30]Péter Györgyi, Tamás Kis:
Reductions between scheduling problems with non-renewable resources and knapsack problems. Theor. Comput. Sci. 565: 63-76 (2015) - 2014
- [j29]Tamás Kis:
Lift-and-project for general two-term disjunctions. Discret. Optim. 12: 98-114 (2014) - [j28]Péter Györgyi, Tamás Kis:
Approximation schemes for single machine scheduling with non-renewable resource constraints. J. Sched. 17(2): 135-144 (2014) - 2013
- [j27]Tamás Kis, András Kovács:
Exact solution approaches for bilevel lot-sizing. Eur. J. Oper. Res. 226(2): 237-245 (2013) - [j26]Egon Balas, Gérard Cornuéjols, Tamás Kis, Giacomo Nannicini:
Combining Lift-and-Project and Reduce-and-Split. INFORMS J. Comput. 25(3): 475-487 (2013) - [j25]Gérard Cornuéjols, Tamás Kis, Marco Molinaro:
Lifting Gomory cuts with bounded variables. Oper. Res. Lett. 41(2): 142-146 (2013) - [j24]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): 337-346 (2013) - 2012
- [j23]Tamás Kis, András Kovács:
A cutting plane approach for integrated planning and scheduling. Comput. Oper. Res. 39(2): 320-327 (2012) - [j22]Tamás Kis, András Kovács:
On bilevel machine scheduling problems. OR Spectr. 34(1): 43-68 (2012) - 2011
- [j21]András Kovács, Tamás Kis:
Constraint programming approach to a bilevel scheduling problem. Constraints An Int. J. 16(3): 317-340 (2011) - [j20]Márton Drótos, Tamás Kis:
Resource leveling in a machine environment. Eur. J. Oper. Res. 212(1): 12-21 (2011) - 2010
- [j19]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): 112-126 (2010) - [j18]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) - [j17]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): 453-461 (2010)
2000 – 2009
- 2009
- [j16]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): 296-306 (2009) - [j15]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): 55-68 (2009) - [j14]Tamás Kis:
Scheduling multiprocessor UET tasks of two sizes. Theor. Comput. Sci. 410(47-49): 4864-4873 (2009) - 2008
- [j13]Dominique de Werra, Tamás Kis, Wieslaw Kubiak:
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications. J. Sched. 11(1): 75-83 (2008) - 2007
- [j12]Tamás Kis, Richárd Kápolnai:
Approximations and auctions for scheduling batches on related machines. Oper. Res. Lett. 35(1): 61-68 (2007) - [c4]András Kéri, Tamás Kis:
Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method. CPAIOR 2007: 127-140 - 2006
- [j11]Tamás Kis:
Polyhedral results on single node variable upper-bound flow models with allowed configurations. Discret. Optim. 3(4): 341-353 (2006) - 2005
- [j10]Tamás Kis, Erwin Pesch:
A review of exact solution methods for the non-preemptive multiprocessor flowshop problem. Eur. J. Oper. Res. 164(3): 592-608 (2005) - [j9]Tamás Kis:
A branch-and-cut algorithm for scheduling of projects with variable-intensity activities. Math. Program. 103(3): 515-539 (2005) - [j8]Tamás Kis:
Project scheduling: a review of recent books. Oper. Res. Lett. 33(1): 105-110 (2005) - [c3]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 - [c2]András Kéri, Tamás Kis:
Primal-Dual Combined with Constraint Propagation for Solving RCPSPWET. OR 2005: 685-690 - 2004
- [j7]András Kovács, Tamás Kis:
Partitioning of trees for minimizing height and cardinality. Inf. Process. Lett. 89(4): 181-185 (2004) - [j6]Tamás Kis:
On the complexity of the car sequencing problem. Oper. Res. Lett. 32(4): 331-335 (2004) - 2003
- [j5]Tamás Kis, Alain Hertz:
A Lower Bound for the Job Insertion Problem. Discret. Appl. Math. 128(2-3): 395-419 (2003) - [j4]Tamás Kis:
Job-shop scheduling with processing alternatives. Eur. J. Oper. Res. 151(2): 307-332 (2003) - 2002
- [j3]Tamás Kis:
On the Complexity of Non-preemptive Shop Scheduling with Two Jobs. Computing 69(1): 37-49 (2002) - 2001
- [j2]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): 23-26 (2001) - 2000
- [j1]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): 191-207 (2000)
1990 – 1999
- 1996
- [c1]Tamás Kis, József Váncza, András Márkus:
Controlling Distributed Manufacturing Systems by a Market Mechanism. ECAI 1996: 534-538
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
