activity
20192025
most citedA common approximation framework for the early work, the late work, and resource leveling problems with unit time jobs

20 citations · 22 across the 5 of their papers we have counts for

collaborators

5 papers

math.OC2025

Optimization techniques for modeling with piecewise-linear functions

Péter Dobrovoczki, Tamás Kis

In this paper we aim to construct piecewise-linear (PWL) approximations for functions of multiple variables and to build compact mixed-integer linear programming (MILP) formulation…

cs.DS2022★ 1 cited

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…

cs.DS2021

Joint replenishment meets scheduling

Péter Györgyi, Tamás Kis, Tímea Tamási +1

In this paper we consider a combination of the joint replenishment problem (JRP) and single machine scheduling with release dates. There is a single machine and one or more item ty…

math.OC2020★ 1 cited

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,…

cs.DS2019★ 20 cited

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…