Country: Netherlands

Found 18376 papers in total
The scheduling problem of printed circuit boards for multiple non-identical parallel machines
The scheduling problem of printed circuit boards for multiple non-identical parallel machines
2004,
The scheduling problem of n printed circuit boards (PCBs) for m non-identical parallel...
A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates
A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates
2004,
In this paper, we present a Branch-and-Bound procedure to minimize total tardiness on...
A new rule for minimizing the number of tardy jobs in dynamic flow shops
A new rule for minimizing the number of tardy jobs in dynamic flow shops
2004,
In this paper we present a new scheduling rule for minimizing the number of tardy jobs...
The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm
The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm
2004,
This paper presents a branch-and-bound algorithm for the two-machine flowshop...
Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs
Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs
2004,
The degree-constrained minimal spanning tree (DCMST) problem with unreliable links and...
Mean flow time minimization with given bounds of processing times
Mean flow time minimization with given bounds of processing times
2004,
We consider a job shop scheduling problem under uncertain processing times and fixed...
The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges
The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges
2000,
The problem studied in this paper is that of finding the maximum number of Hamiltonian...
Common due date scheduling with autonomous and induced learning
Common due date scheduling with autonomous and induced learning
2004,
Up to now the few existing models that consider learning effects in scheduling,...
On the k-cut problem
On the k-cut problem
2000,
Given a graph with nonnegative edge-weights, let f(k) be the value of an optimal...
A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation
A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation
2004,
We propose in this paper an effective heuristic algorithm to solve a scheduling...
On the structure and complexity of the 2-connected Steiner network problem in the plane
On the structure and complexity of the 2-connected Steiner network problem in the plane
2000,
We consider the problem of finding a minimum Euclidean length graph 2-connecting a set...
Sparse certificates and removable cycles in l-mixed p-connected graphs
Sparse certificates and removable cycles in l-mixed p-connected graphs
2005,
A graph G=(V,E) is called l -mixed p -connected if G-S-L is connected for all...
Approximating k-hop minimum-spanning trees
Approximating k-hop minimum-spanning trees
2005,
Given a complete graph on ∼ n nodes with metric edge costs, the minimum-cost k...
On the average sojourn time under M/M/1/SRPT
On the average sojourn time under M/M/1/SRPT
2005,
We study an M/M/1 queueing system under the shortest remaining processing time (SRPT)...
Improving activity-based costing heuristics by higher-level cost drivers
Improving activity-based costing heuristics by higher-level cost drivers
2004,
Activity-based costing (ABC) tries to allocate overhead costs to cost objects more...
On approximation of the submodular set cover problem
On approximation of the submodular set cover problem
1999,
We design a primal–dual heuristic for the submodular set cover problem and...
A note on policy algorithms for discounted Markov decision problems
A note on policy algorithms for discounted Markov decision problems
1999,
In this note, we show that the evaluation phase in the policy iteration algorithm for...
Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models
Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models
2000,
This paper studies the classification problem of Markov processes of M/G/1 type with a...
A fast algorithm for the transient reward distribution in continuous-time Markov chains
A fast algorithm for the transient reward distribution in continuous-time Markov chains
2000,
This note presents a generally applicable discretization method for computing the...
Multi-period design of survivable wireless access networks under capacity constraints
Multi-period design of survivable wireless access networks under capacity constraints
2005,
Design of survivable wireless access networks plays a key role in the overall design...
A cutting plane algorithm for computing k-edge survivability of a network
A cutting plane algorithm for computing k-edge survivability of a network
2004,
Given an undirected network and a set of traffic demands between pairs of nodes, k...
An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
2004,
Frequencies have to be assigned to transmitters whenever a radio network is...
A new scaling algorithm for the minimum cost network flow problem
A new scaling algorithm for the minimum cost network flow problem
1999,
In this paper, we present a new polynomial time algorithm for solving the minimum cost...
Simplicial with truncated Dantzig–Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints
Simplicial with truncated Dantzig–Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints
2000,
The simplicial decomposition (SD) subproblem for a nonlinear multicommodity network...
Papers per page: