Approximation schemes for parallel machine scheduling with non-renewable resources von Györgyi, Péter, Kis, Tamás

Volltext

On variants of a load-balancing problem with unit-load jobs von Györgyi, Péter, Kis, Tamás, Szögi, Evelin

Volltext

Polyhedral Results and Branch-and-Cut for the Resource Loading Problem von Song, Guopeng, Kis, Tamás, Leus, Roel

Volltext

Exact solution approaches for bilevel lot-sizing von Kis, Tamás, Kovács, András

Volltext

A branch-and-cut algorithm for scheduling of projects with variable-intensity activities von KIS, Tamas

Volltext

Scheduling jobs to minimize a convex function of resource usage von Kis, Tamás, Szögi, Evelin

Volltext

A probabilistic approach to pickup and delivery problems with time window uncertainty von Györgyi, Péter, Kis, Tamás

Volltext

Facet separation for disjunctive constraints with network flow representation von Dobrovoczki, Péter, Kis, Tamás

Volltext

Strong cuts from compatibility relations for the Dial-a-Ride Problem von Morapitiye, Sunil, Kis, Tamás

Volltext

Ideal, non-extended formulations for disjunctive constraints admitting a network representation von Kis, Tamás, Horváth, Markó

Volltext

A common approximation framework for early work, late work, and resource leveling problems von Györgyi, Péter, Kis, Tamás

Volltext

Allocating raw materials to competing projects von Egri, Peter, Kis, Tamás

Volltext

New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints von Györgyi, Péter, Kis, Tamás

Volltext

Robust facility location in reverse logistics von Egri, Péter, Dávid, Balázs, Kis, Tamás, Krész, Miklós

Volltext

Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints von Györgyi, Péter, Kis, Tamás

Volltext

Suboptimal and conflict-free control of a fleet of AGVs to serve online requests von Drótos, Márton, Györgyi, Péter, Horváth, Markó, Kis, Tamás

Volltext

Solving resource constrained shortest path problems with LP-based methods von Horváth, Markó, Kis, Tamás

Volltext

An online joint replenishment problem combined with single machine scheduling von Györgyi, Péter, Kis, Tamás, Tamási, Tímea

Volltext

Polyhedral results for position-based scheduling of chains on a single machine von Horváth, Markó, Kis, Tamás

Volltext

Assembly planning by disjunctive programming and geometrical reasoning von Horváth, Markó, Kis, Tamás, Kovács, András, Fekula, Márk

Volltext