Country: Netherlands

Found 18376 papers in total
Approximation algorithms for scheduling a single machine to minimize total late work
Approximation algorithms for scheduling a single machine to minimize total late work
1992,
In the problem of scheduling a single machine to minimize total late work, there are n...
Sequencing to minimize the maximum renewal cumulative cost
Sequencing to minimize the maximum renewal cumulative cost
1992,
This paper considers the problem of sequencing n independent tasks, each of which is...
A characterization of the uncapacitated network design polytope
A characterization of the uncapacitated network design polytope
1992,
The uncapacitated network design problem is considered. The authors show that the...
The exact LPT-bound for maximizing the minimum completion time
The exact LPT-bound for maximizing the minimum completion time
1992,
The authors consider the problem of assigning a set of jobs to a system of m identical...
Algorithms for the minimum cost circulation problem based on maximizing the mean improvement
Algorithms for the minimum cost circulation problem based on maximizing the mean improvement
1992,
Several recent polynomial algorithms for the minimum cost circulation problem have the...
Dynamic priority rules when polling with multiple parallel servers
Dynamic priority rules when polling with multiple parallel servers
1992,
In this paper the authors extend previous results (by Browne and Yechiali) on dynamic...
The ‘Orchard’ scheduler for manufacturing systems
The ‘Orchard’ scheduler for manufacturing systems
1992,
This paper describes Orchard, which is a heuristic algorithm for scheduling the...
A simple proof of the planar rectilinear Steiner ratio
A simple proof of the planar rectilinear Steiner ratio
1992,
The rectilinear Steiner ratio is the worst-case ratio of the length of a rectilinear...
On the complexity of scheduling tasks with discrete starting times
On the complexity of scheduling tasks with discrete starting times
1992,
The paper considers the problem of scheduling tasks with a discrete set of possible...
On the computational complexity of reliability redundancy allocation in a series system
On the computational complexity of reliability redundancy allocation in a series system
1992,
Finding the optimal redundancy that maximizes the system reliability is one of the...
Efficient heuristics to minimize total flow time with release dates
Efficient heuristics to minimize total flow time with release dates
1992,
This paper addresses the one machine scheduling problem to minimize total flow time...
A total-value greedy heuristic for the integer knapsack problem
A total-value greedy heuristic for the integer knapsack problem
1992,
This paper examines a new greedy heuristic for the integer knapsack problem. The...
The complexity of lifted inequalities for the knapsack problem
The complexity of lifted inequalities for the knapsack problem
1992,
It is well known that one can obtain facets and valid inequalities for the knapsack...
Hamiltonian cycle is polynomial on cocomparability graphs
Hamiltonian cycle is polynomial on cocomparability graphs
1992,
Finding a Hamiltonian path or a Hamiltonian cycle in a general graph are classic...
Local search and the local structure of NP-complete problems
Local search and the local structure of NP-complete problems
1992,
It is shown that certain NP-complete problems (traveling salesman, min-cut graph...
Processor interconnection networks from Cayley graphs
Processor interconnection networks from Cayley graphs
1992,
Cayley graphs of groups are presently being considered by the computer science...
Uniformization for nonhomogeneous Markov chains
Uniformization for nonhomogeneous Markov chains
1992,
The discrete Poissonian representation for transition probabilities of homogeneous...
Functional dependencies in relational databases: A lattice point of view
Functional dependencies in relational databases: A lattice point of view
1992,
A lattice theoretic approach is developed to study the properties of functional...
Numerical inversion of probability generating functions
Numerical inversion of probability generating functions
1992,
Random quantities of interest in operations research models can often be determined...
Selective inheritance of attribute values in relational databases
Selective inheritance of attribute values in relational databases
1992,
Selective inheritance dependencies, or SIDs, are introduced to capture formally the...
Solving linear bottleneck assignment problems via strong spanning trees
Solving linear bottleneck assignment problems via strong spanning trees
1992,
An efficient algorithm for solving the n×n linear bottleneck assignment problem...
Locking based on a pairwise decomposition of a transaction system
Locking based on a pairwise decomposition of a transaction system
1992,
Locking is a synchronization primitive used in database systems to guarantee...
A knowledge-based assignment methodology for personal identification in mass disaster
A knowledge-based assignment methodology for personal identification in mass disaster
1992,
A knowledge-based assignment methodology (KBAM) for providing decision support to...
The number of keys in relational and nested relational databases
The number of keys in relational and nested relational databases
1992,
Combinatorial propositions, concerning the maximal number of minimal keys are...
Papers per page: