Tamás Kis

According to our database1, Tamás Kis authored at least 59 papers between 1996 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Strong cuts from compatibility relations for the Dial-a-Ride Problem.
Discret. Appl. Math., 2022

New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints.
Discret. Appl. Math., 2022

A project scheduling problem with periodically aggregated resource-constraints.
Comput. Oper. Res., 2022

Assembly planning by disjunctive programming and geometrical reasoning.
Comput. Oper. Res., 2022

2021
Polyhedral Results and Branch-and-Cut for the Resource Loading Problem.
INFORMS J. Comput., 2021

Joint replenishment meets scheduling.
CoRR, 2021

Suboptimal and conflict-free control of a fleet of AGVs to serve online requests.
Comput. Ind. Eng., 2021

2020
A common approximation framework for early work, late work, and resource leveling problems.
Eur. J. Oper. Res., 2020

Allocating raw materials to competing projects.
Comput. Ind. Eng., 2020

Polyhedral results for position-based scheduling of chains on a single machine.
Ann. Oper. Res., 2020

2019
Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints.
J. Sched., 2019

A probabilistic approach to pickup and delivery problems with time window uncertainty.
Eur. J. Oper. Res., 2019

Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem.
Discret. Appl. Math., 2019

A common approximation framework for the early work, the late work, and resource leveling problems with unit time jobs.
CoRR, 2019

Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price.
Central Eur. J. Oper. Res., 2019

2018
Multi-criteria approximation schemes for the resource constrained shortest path problem.
Optim. Lett., 2018

Computational advances in combinatorial optimization.
Discret. Appl. Math., 2018

Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut.
Comput. Ind. Eng., 2018

2017
Approximation schemes for parallel machine scheduling with non-renewable resources.
Eur. J. Oper. Res., 2017

2016
On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts.
Math. Program., 2016

A Set of Successive Job Allocation Models in Distributed Computing Infrastructures.
J. Grid Comput., 2016

Solving resource constrained shortest path problems with LP-based methods.
Comput. Oper. Res., 2016

2015
Reductions between scheduling problems with non-renewable resources and knapsack problems.
Theor. Comput. Sci., 2015

Approximability of total weighted completion time with resource consuming jobs.
Oper. Res. Lett., 2015

Intersection cuts - standard versus restricted.
Discret. Optim., 2015

Approximability of scheduling problems with resource consuming jobs.
Ann. Oper. Res., 2015

2014
Approximation schemes for single machine scheduling with non-renewable resource constraints.
J. Sched., 2014

Lift-and-project for general two-term disjunctions.
Discret. Optim., 2014

2013
Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times.
J. Sched., 2013

Lifting Gomory cuts with bounded variables.
Oper. Res. Lett., 2013

Combining Lift-and-Project and Reduce-and-Split.
INFORMS J. Comput., 2013

Exact solution approaches for bilevel lot-sizing.
Eur. J. Oper. Res., 2013

2012
On bilevel machine scheduling problems.
OR Spectr., 2012

A cutting plane approach for integrated planning and scheduling.
Comput. Oper. Res., 2012

2011
Resource leveling in a machine environment.
Eur. J. Oper. Res., 2011

Constraint programming approach to a bilevel scheduling problem.
Constraints An Int. J., 2011

2010
Scheduling of coupled tasks with unit processing times.
J. Sched., 2010

A projective algorithm for preemptive open shop scheduling with two multiprocessor groups.
Oper. Res. Lett., 2010

Digital enterprise solution for integrated production planning and control.
Comput. Ind., 2010

2009
Scheduling multiprocessor UET tasks of two sizes.
Theor. Comput. Sci., 2009

Real-time, cooperative enterprises for customised mass production.
Int. J. Comput. Integr. Manuf., 2009

Computing lower and upper bounds for a large-scale industrial job shop scheduling problem.
Eur. J. Oper. Res., 2009

2008
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications.
J. Sched., 2008

2007
Approximations and auctions for scheduling batches on related machines.
Oper. Res. Lett., 2007

Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007

2006
Polyhedral results on single node variable upper-bound flow models with allowed configurations.
Discret. Optim., 2006

2005
Project scheduling: a review of recent books.
Oper. Res. Lett., 2005

A branch-and-cut algorithm for scheduling of projects with variable-intensity activities.
Math. Program., 2005

A review of exact solution methods for the non-preemptive multiprocessor flowshop problem.
Eur. J. Oper. Res., 2005

Primal-Dual Combined with Constraint Propagation for Solving RCPSPWET.
Proceedings of the Operations Research Proceedings 2005, 2005

Proterv-II: An Integrated Production Planning and Scheduling System.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2004
On the complexity of the car sequencing problem.
Oper. Res. Lett., 2004

Partitioning of trees for minimizing height and cardinality.
Inf. Process. Lett., 2004

2003
Job-shop scheduling with processing alternatives.
Eur. J. Oper. Res., 2003

A Lower Bound for the Job Insertion Problem.
Discret. Appl. Math., 2003

2002
On the Complexity of Non-preemptive Shop Scheduling with Two Jobs.
Computing, 2002

2001
A note on the complexity of scheduling coupled tasks on a single processor.
J. Braz. Comput. Soc., 2001

2000
A Petri net model for integrated process and job shop production planning.
J. Intell. Manuf., 2000

1996
Controlling Distributed Manufacturing Systems by a Market Mechanism.
Proceedings of the 12th European Conference on Artificial Intelligence, 1996


  Loading...