Tamás Kis

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
A probabilistic approach to pickup and delivery problems with time window uncertainty.
European Journal of Operational Research, 2019

Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem.
Discrete Applied Mathematics, 2019

Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price.
CEJOR, 2019

2018
Multi-criteria approximation schemes for the resource constrained shortest path problem.
Optimization Letters, 2018

Computational advances in combinatorial optimization.
Discrete Applied Mathematics, 2018

Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut.
Computers & Industrial Engineering, 2018

2017
Approximation schemes for parallel machine scheduling with non-renewable resources.
European Journal of Operational Research, 2017

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

Solving resource constrained shortest path problems with LP-based methods.
Computers & OR, 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.
Discrete Optimization, 2015

Approximability of scheduling problems with resource consuming jobs.
Annals OR, 2015

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

Lift-and-project for general two-term disjunctions.
Discrete Optimization, 2014

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

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

Combining Lift-and-Project and Reduce-and-Split.
INFORMS Journal on Computing, 2013

Exact solution approaches for bilevel lot-sizing.
European Journal of Operational Research, 2013

2012
On bilevel machine scheduling problems.
OR Spectrum, 2012

A cutting plane approach for integrated planning and scheduling.
Computers & OR, 2012

2011
Resource leveling in a machine environment.
European Journal of Operational Research, 2011

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

2010
Scheduling of coupled tasks with unit processing times.
J. Scheduling, 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.
Computers in Industry, 2010

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

Real-time, cooperative enterprises for customised mass production.
Int. J. Computer Integrated Manufacturing, 2009

Computing lower and upper bounds for a large-scale industrial job shop scheduling problem.
European Journal of Operational Research, 2009

2008
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications.
J. Scheduling, 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.
Discrete Optimization, 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.
European Journal of Operational Research, 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.
European Journal of Operational Research, 2003

A Lower Bound for the Job Insertion Problem.
Discrete Applied Mathematics, 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. Comp. Soc., 2001

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

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


  Loading...