受强制性开放获取政策约束的文章 - Péter Györgyi了解详情
可在其他位置公开访问的文章：20 篇
Approximation schemes for parallel machine scheduling with non-renewable resources
P Györgyi, T Kis
European Journal of Operational Research 258 (1), 113-123, 2017
强制性开放获取政策： Magyar Tudományos Akadémia, Hungarian Scientific Research Fund
A probabilistic approach to pickup and delivery problems with time window uncertainty
P Györgyi, T Kis
European Journal of Operational Research 274 (3), 909-923, 2019
强制性开放获取政策： National Office for Research, Development and Innovation, Hungary
Approximation schemes for single machine scheduling with non-renewable resource constraints
P Györgyi, T Kis
Journal of Scheduling 17, 135-144, 2014
强制性开放获取政策： Magyar Tudományos Akadémia
Approximability of scheduling problems with resource consuming jobs
P Györgyi, T Kis
Annals of Operations Research 235 (1), 319-336, 2015
强制性开放获取政策： Magyar Tudományos Akadémia, Hungarian Scientific Research Fund
Reductions between scheduling problems with non-renewable resources and knapsack problems
P Györgyi, T Kis
Theoretical Computer Science 565, 63-76, 2015
强制性开放获取政策： Magyar Tudományos Akadémia, Hungarian Scientific Research Fund
Suboptimal and conflict-free control of a fleet of AGVs to serve online requests
M Drótos, P Györgyi, M Horváth, T Kis
Computers & Industrial Engineering 152, 106999, 2021
强制性开放获取政策： Magyar Tudományos Akadémia, National Office for Research, Development and …
Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
P Györgyi, T Kis
Journal of Scheduling, 2019
强制性开放获取政策： National Office for Research, Development and Innovation, Hungary
Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut
P Györgyi, T Kis
Computers & Industrial Engineering 115, 220-225, 2018
强制性开放获取政策： National Office for Research, Development and Innovation, Hungary
A PTAS for a resource scheduling problem with arbitrary number of parallel machines
P Györgyi
Operations Research Letters 45 (6), 604-609, 2017
强制性开放获取政策： Hungarian Scientific Research Fund
A common approximation framework for early work, late work, and resource leveling problems
P Györgyi, T Kis
European Journal of Operational Research 286 (1), 129-137, 2020
强制性开放获取政策： Magyar Tudományos Akadémia, National Office for Research, Development and …
New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints
P Györgyi, T Kis
Discrete Applied Mathematics 311, 97-109, 2022
强制性开放获取政策： Magyar Tudományos Akadémia, National Office for Research, Development and …
On the number of touching pairs in a set of planar curves
P Györgyi, B Hujter, S Kisfaludi-Bak
Computational Geometry 67, 29-37, 2018
强制性开放获取政策： Hungarian Scientific Research Fund, Netherlands Organisation for Scientific …
A multivariate complexity analysis of the material consumption scheduling problem
M Bentert, R Bredereck, P Györgyi, A Kaczmarczyk, R Niedermeier
Journal of Scheduling 26 (4), 369-382, 2023
强制性开放获取政策： German Research Foundation, Magyar Tudományos Akadémia, National Office for …
Joint replenishment meets scheduling
P Györgyi, T Kis, T Tamási, J Békési
Journal of Scheduling 26 (1), 77-94, 2023
强制性开放获取政策： National Office for Research, Development and Innovation, Hungary
A P2P based storage system with reputation points and simulation results
B Bakondi, P Burcsi, P Györgyi, D Herskovics, P Ligeti, L Mérai, DA Nagy, ...
Central European Conference on Cryptology (CECC), 2014
强制性开放获取政策： Hungarian Scientific Research Fund
Approximation algorithms for coupled task scheduling minimizing the sum of completion times
D Fischer, P Györgyi
Annals of operations research 328 (2), 1387-1408, 2023
强制性开放获取政策： German Research Foundation, Magyar Tudományos Akadémia, Federal Ministry of …
A production scheduling and control system for CAR T cell manufacturing
T Kis, S Hort, P Györgyi, E Szögi, RH Schmitt
Procedia CIRP 125, 36-41, 2024
强制性开放获取政策： European Commission
An online joint replenishment problem combined with single machine scheduling
P Györgyi, T Kis, T Tamási
Journal of Combinatorial Optimization 45 (5), 134, 2023
强制性开放获取政策： Magyar Tudományos Akadémia, European Commission, National Office for …
Joint replenishment meets scheduling
T Kis, P Györgyi, T Tamási, J Békési
强制性开放获取政策： Magyar Tudományos Akadémia, National Office for Research, Development and …
Joint replenishment meets scheduling
J Békési, P Györgyi, T Kis
强制性开放获取政策： Magyar Tudományos Akadémia, National Office for Research, Development and …
出版信息和资助信息由计算机程序自动确定