Knust Sigrid

Sigrid Knust

Information about the author Sigrid Knust will soon be added to the site.
Found 15 papers in total
A note on ‘event‐based MILP models for resource‐constrained project scheduling problems’
A note on ‘event‐based MILP models for resource‐constrained project scheduling problems’
2013
Recently, new mixed integer linear programming formulations for the...
Tabu search and lower bounds for a combined production–transportation problem
Tabu search and lower bounds for a combined production–transportation problem
2013
In this paper we consider a combined production–transportation problem, where n...
Shift scheduling for tank trucks
Shift scheduling for tank trucks
2011
In this paper we deal with shift scheduling of tank trucks for a small oil company....
Parallel batch scheduling of equal-length jobs with release and due dates
Parallel batch scheduling of equal-length jobs with release and due dates
2010
In this paper we study parallel batch scheduling problems with bounded batch capacity...
Scheduling sports tournaments on a single court minimizing waiting times
Scheduling sports tournaments on a single court minimizing waiting times
2008
We consider a sports tournament for an odd number of teams where every team plays...
Sports league scheduling: graph- and resource-based models
Sports league scheduling: graph- and resource-based models
2007
Generating a sports league schedule is a challenging task due to the variety of...
Balanced home–away assignments
Balanced home–away assignments
2006
In recent years several approaches for generating sports league schedules have been...
Complexity results for flow-shop problems with a single server
Complexity results for flow-shop problems with a single server
2005
Flow-shop problems with a single server are generalizations of classical flow-shop...
Tabu search algorithms for job-shop problems with a single transport robot
Tabu search algorithms for job-shop problems with a single transport robot
2005
We consider a generalized job-shop problem where the jobs additionally have to be...
Complexity results for flow-shop and open-shop scheduling problems with transportation delays
Complexity results for flow-shop and open-shop scheduling problems with transportation delays
2004
We consider shop problems with transportation delays where not only the jobs on the...
Lower bounds for resource-constrained project scheduling problems
Lower bounds for resource-constrained project scheduling problems
2003
A destructive lower bound for the multi-mode resource-constrained project scheduling...
Complexity results for parallel machine problems with a single server
Complexity results for parallel machine problems with a single server
2002
Parallel machine problems with a single server are generalizations of classical...
Lower bounds for scheduling a single robot in a job-shop environment
Lower bounds for scheduling a single robot in a job-shop environment
2002
We consider a single-machine scheduling problem which arises as a subproblem in a...
A linear programming and constraint propagation-based lower bound for the resource-constrained project scheduling problem
A linear programming and constraint propagation-based lower bound for the resource-constrained project scheduling problem
2000
A new destructive lower bound for the resource-constrained project scheduling problem...
A branch and bound algorithm for the resource-constrained project scheduling problem
A branch and bound algorithm for the resource-constrained project scheduling problem
1998
A branch and bound algorithm is presented for the resource-constrained project...
Papers per page: