Kis Tams

Tams Kis

Information about the author Tams Kis will soon be added to the site.
Found 14 papers in total
Combining Lift‐and‐Project and Reduce‐and‐Split
Combining Lift‐and‐Project and Reduce‐and‐Split
2013
Split cuts constitute a class of cutting planes that has been successfully employed by...
Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times
Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times
2013
In this note we provide new complexity and algorithmic results for scheduling...
Exact solution approaches for bilevel lot‐sizing
Exact solution approaches for bilevel lot‐sizing
2013
In this paper we propose exact solution methods for a bilevel uncapacitated...
On bilevel machine scheduling problems
On bilevel machine scheduling problems
2012
Bilevel scheduling problems constitute a hardly studied area of scheduling theory. In...
Resource leveling in a machine environment
Resource leveling in a machine environment
2011
We address resource leveling problems in a machine environment. Given a set of m...
A projective algorithm for preemptive open shop scheduling with two multiprocessor groups
A projective algorithm for preemptive open shop scheduling with two multiprocessor groups
2010
We study a multiprocessor extension of the preemptive open shop scheduling problem,...
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications
2008
This paper addresses a multiprocessor generalization of the preemptive open-shop...
Approximations and auctions for scheduling batches on related machines
Approximations and auctions for scheduling batches on related machines
2007
We consider the scheduling of groups of identical jobs on related machines with...
Polyhedral results on single node variable upper-bound flow models with allowed configurations
Polyhedral results on single node variable upper-bound flow models with allowed configurations
2006
In this paper we investigate the convex hull of single node variable upper-bound flow...
A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
2005
The hybrid or flexible flowshop problem is a generalization of the flowshop in such a...
On the complexity of the car sequencing problem
On the complexity of the car sequencing problem
2004
In this note we give an easier proof of the known result that the car sequencing...
Project scheduling: a review of recent books
Project scheduling: a review of recent books
2005
This paper is a review of three related books: Erik L. Demeulemeester and Willy S....
Job-shop scheduling with processing alternatives
Job-shop scheduling with processing alternatives
2003
In this paper we study an extension of the job-shop scheduling problem where the job...
On the complexity of non-preemptive shop scheduling with two jobs
On the complexity of non-preemptive shop scheduling with two jobs
2002
In this note, we investigate the time complexity of non-preemptive shop scheduling...
Papers per page: