Print preview VALIDITY EXPIRED personal data approved: 2022. IV. 08. Publications |
2022
from data base, 2023. XII. 02. |
Györgyi Péter, Kis Tamás: New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints, DISCRETE APPLIED MATHEMATICS 311: pp. 97-109. type of document: Journal paper/Article number of independent citations: 4 language: English URL |
2019
from data base, 2023. XII. 02. |
Horváth M, Kis T: Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price, CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH 27: (1) pp. 39-67. type of document: Journal paper/Article number of independent citations: 25 language: English URL |
2019
from data base, 2023. XII. 02. |
Györgyi Péter, Kis Tamás: Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints, JOURNAL OF SCHEDULING 22: (6) pp. 623-634. type of document: Journal paper/Article number of independent citations: 6 language: English URL |
2019
from data base, 2023. XII. 02. |
Györgyi P, Kis T: A probabilistic approach to pickup and delivery problems with time window uncertainty, EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 274: (3) pp. 909-923. type of document: Journal paper/Article number of independent citations: 24 language: English URL |
2018
from data base, 2023. XII. 02. |
Györgyi P, Kis T: Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut, COMPUTERS AND INDUSTRIAL ENGINEERING 115: pp. 220-225. type of document: Journal paper/Article number of independent citations: 7 language: English URL |
2017
from data base, 2023. XII. 02. |
Györgyi P, Kis T: Approximation schemes for parallel machine scheduling with non-renewable resources, EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 258: (1) pp. 113-123. type of document: Journal paper/Article number of independent citations: 16 language: English URL |
2016
from data base, 2023. XII. 02. |
Horváth M, Kis T: Solving resource constrained shortest path problems with LP-based methods, COMPUTERS & OPERATIONS RESEARCH 73: pp. 150-164. type of document: Journal paper/Article number of independent citations: 24 language: English URL |
2009
from data base, 2023. XII. 02. |
Drótos M, Erdős F, Kis T: Computing lower and upper bounds for a large-scale industrial job shop scheduling problem, EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 197: (1) pp. 296-306. type of document: Journal paper/Article number of independent citations: 25 language: English URL |
2005
from data base, 2023. XII. 02. |
Kis T: A branch-and-cut algorithm for scheduling of projects with variable-intensity activities, MATHEMATICAL PROGRAMMING 103: (3) pp. 515-539. type of document: Journal paper/Article number of independent citations: 82 language: English URL |
2004
from data base, 2023. XII. 02. |
Kis T: On the complexity of the car sequencing problem, OPERATIONS RESEARCH LETTERS 32: (4) pp. 331-335. type of document: Journal paper/Article number of independent citations: 91 language: English URL |
| Number of independent citations to these publications: | 304 |
|
|