Spieksma Frits C.R.

Frits C.R. Spieksma

Information about the author Frits C.R. Spieksma will soon be added to the site.
Found 20 papers in total
Exact algorithms for procurement problems under a total quantity discount structure
Exact algorithms for procurement problems under a total quantity discount structure
2007
In this paper, we study the procurement problem faced by a buyer who needs to purchase...
Modeling and solving the periodic maintenance problem
Modeling and solving the periodic maintenance problem
2006
We study the problem of scheduling maintenance services. Given is a set of m machines...
Interval scheduling: a survey
Interval scheduling: a survey
2007
In interval scheduling, not only the processing times of the jobs but also their...
Pricing bridges to cross a river
Pricing bridges to cross a river
2007
We consider a pricing problem in directed, uncapacitated networks. Tariffs must be...
The no-wait flow-shop paradox
The no-wait flow-shop paradox
2005
We discuss a new resource paradox in the area of scheduling: Increasing the speed of...
Selecting telecommunication carriers to obtain volume discounts
Selecting telecommunication carriers to obtain volume discounts
2005
During 2001 many European markets for mobile phones reached saturation. Hence, mobile...
Primal–dual approximation algorithms for a packing–covering pair of problems
Primal–dual approximation algorithms for a packing–covering pair of problems
2002
We consider a special packing–covering pair of problems. The packing problem is...
Lifting theorems and facet characterization for a class of clique partitioning inequalities
Lifting theorems and facet characterization for a class of clique partitioning inequalities
1999
In this paper we prove two lifting theorems for the clique partitioning polytope,...
A branch-and-price algorithm for a hierarchical crew scheduling problem
A branch-and-price algorithm for a hierarchical crew scheduling problem
2002
We describe a real-life problem arising at a crane rental company. This problem is a...
On the approximability of an interval scheduling problem
On the approximability of an interval scheduling problem
1999
In this paper we consider a general interval scheduling problem. The problem is a...
The computational complexity of a bin packing game
The computational complexity of a bin packing game
1994
In this paper we investigate the following game: two players I and II must alternately...
The assembly of printed circuit boards: A case with multiple machines and multiple board types
The assembly of printed circuit boards: A case with multiple machines and multiple board types
1997
In this paper a typical situation arising in the assembly of printed circuit boards is...
Geometric three-dimensional assignment problems
Geometric three-dimensional assignment problems
1996
We investigate two geometric special cases of the three-dimensional assignment...
Optimal service control against worst case admission policies: A multichained stochastic game
Optimal service control against worst case admission policies: A multichained stochastic game
1997
In this paper we will consider two-person zero-sum games and derive a general approach...
The component retrieval problem in printed circuit board assembly
The component retrieval problem in printed circuit board assembly
1996
Minimization of the makespan of a printed circuit board assembly process is a complex...
Scheduling jobs of equal length: Complexity, facets and computational results
Scheduling jobs of equal length: Complexity, facets and computational results
1996
The following problem was originally motivated by a question arising in the automated...
Approximation algorithms for three-dimensional assignment problems with triangle inequalities
Approximation algorithms for three-dimensional assignment problems with triangle inequalities
1992
The three-dimensional assignment problem (3DA) is defined as follows. Given are three...
Scheduling with Safety Distances
Scheduling with Safety Distances
1995
The authors investigate the problem of Scheduling with Safety Distances (SSD) that...
Minimizing the number of tool switches on a flexible machine
Minimizing the number of tool switches on a flexible machine
1994
This article analyzes a tool switching problem arising in certain flexible...
A branch-and-bound algorithm for the two-dimensional vector packing problem
A branch-and-bound algorithm for the two-dimensional vector packing problem
1994
The two-dimensional vector packing (2DVP) problem can be stated as follows. Given are...
Papers per page: