20 citations · 25 across the 6 of their papers we have counts for
6 papers
A cost function approximation method for dynamic vehicle routing with docking and LIFO constraints
Markó Horváth, Tamás Kis, Péter Györgyi
In this paper, we study a dynamic pickup and delivery problem with docking constraints. There is a homogeneous fleet of vehicles to serve pickup-and-delivery requests at given loca…
An online joint replenishment problem combined with single machine scheduling
Péter Györgyi, Tamás Kis, Tímea Tamási
This paper considers a combination of the joint replenishment problem with single machine scheduling. There is a single resource, which is required by all the jobs, and a job can b…
Approximation algorithms for coupled task scheduling minimizing the sum of completion times
David Fischer, Péter Györgyi
In this paper we consider the coupled task scheduling problem with exact delay times on a single machine with the objective of minimizing the total completion time of the jobs. We…
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem
Matthias Bentert, Robert Bredereck, Péter Györgyi +2
The NP-hard MATERIAL CONSUMPTION SCHEDULING Problem and closely related problems have been thoroughly studied since the 1980's. Roughly speaking, the problem deals with minimizing…
New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints
Péter Györgyi, Tamás Kis
In this paper we consider single machine scheduling problems with additional non-renewable resource constraints. Examples for non-renewable resources include raw materials, energy,…
A common approximation framework for the early work, the late work, and resource leveling problems with unit time jobs
Peter Gyorgyi, Tamas Kis
We study the approximability of two related machine scheduling problems. In the late work minimization problem, there are identical parallel machines and the jobs have a common due…