Tamás Kis

Available identifiers

zbMath Open kis.tamasWikidataQ102279133 ScholiaQ102279133MaRDI QIDQ256640

List of research outcomes

Publication	Date of Publication	Type
An online joint replenishment problem combined with single machine scheduling	2023-08-02	Paper
Robust facility location in reverse logistics	2023-07-13	Paper
Joint replenishment meets scheduling	2023-06-23	Paper
Ideal, non-extended formulations for disjunctive constraints admitting a network representation	2022-06-29	Paper
Assembly planning by disjunctive programming and geometrical reasoning	2022-03-09	Paper
A project scheduling problem with periodically aggregated resource-constraints	2022-03-09	Paper
New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints	2022-03-04	Paper
Strong cuts from compatibility relations for the dial-a-ride problem	2022-01-13	Paper
Polyhedral Results and Branch-and-Cut for the Resource Loading Problem	2021-06-23	Paper
A common approximation framework for early work, late work, and resource leveling problems	2020-05-27	Paper
Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints	2020-02-12	Paper
Polyhedral results for position-based scheduling of chains on a single machine	2020-01-20	Paper
Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem	2019-03-22	Paper
Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price	2019-02-15	Paper
A probabilistic approach to pickup and delivery problems with time window uncertainty	2019-01-09	Paper
Approximability of total weighted completion time with resource consuming jobs	2018-09-28	Paper
Erratum to ``Intersection cuts -- standard versus restricted	2018-08-17	Paper
Multi-criteria approximation schemes for the resource constrained shortest path problem	2018-05-28	Paper
Intersection cuts -- standard versus restricted	2018-05-24	Paper
Approximation schemes for parallel machine scheduling with non-renewable resources	2018-02-16	Paper
On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts	2016-11-25	Paper
Solving resource constrained shortest path problems with LP-based methods	2016-11-17	Paper
Approximability of scheduling problems with resource consuming jobs	2016-03-09	Paper
Lift-and-project for general two-term disjunctions	2015-04-09	Paper
Reductions between scheduling problems with non-renewable resources and knapsack problems	2014-12-22	Paper
Approximation schemes for single machine scheduling with non-renewable resource constraints	2014-08-18	Paper
Exact solution approaches for bilevel lot-sizing	2014-07-27	Paper
Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times	2014-02-05	Paper
Lifting Gomory cuts with bounded variables	2013-05-14	Paper
A cutting plane approach for integrated planning and scheduling	2012-11-15	Paper
On bilevel machine scheduling problems	2012-05-23	Paper
Resource leveling in a machine environment	2012-05-14	Paper
Constraint programming approach to a bilevel scheduling problem	2011-11-23	Paper
A projective algorithm for preemptive open shop scheduling with two multiprocessor groups	2010-05-07	Paper
Scheduling multiprocessor UET tasks of two sizes	2009-11-06	Paper
Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications	2009-08-28	Paper
Partitioning of trees for minimizing height and cardinality	2009-07-09	Paper
Computing lower and upper bounds for a large-scale industrial job shop scheduling problem	2009-04-08	Paper
Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method	2009-03-10	Paper
Approximations and auctions for scheduling batches on related machines	2007-08-27	Paper
https://portal.mardi4nfdi.de/entity/Q3426431	2007-03-09	Paper
Polyhedral results on single node variable upper-bound flow models with allowed configurations	2007-02-20	Paper
A branch-and-cut algorithm for scheduling of projects with variable-intensity activities	2005-08-08	Paper
A review of exact solution methods for the non-preemptive multiprocessor flowshop problem	2005-03-08	Paper
On the complexity of the car sequencing problem.	2005-01-11	Paper
Job-shop scheduling with processing alternatives.	2003-10-14	Paper
A lower bound for the job insertion problem.	2003-06-10	Paper
On the complexity of non-preemptive shop scheduling with two jobs	2002-12-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Tamás Kis