Country: Netherlands

Found 18376 papers in total
An evolutionary approach for finding optimal trees in undirected networks
An evolutionary approach for finding optimal trees in undirected networks
2000,
In many utilities, such as water and gas, materials are distributed through networks...
Scheduling with limited machine availability
Scheduling with limited machine availability
2000,
This paper reviews results related to deterministic scheduling problems where machines...
On finding dissimilar paths
On finding dissimilar paths
2000,
Given a transportation network, this paper considers the problem of finding a number...
Minimizing functions of infeasibilities in a two-machine flow shop
Minimizing functions of infeasibilities in a two-machine flow shop
2000,
We consider a class of schedules obtained in the following way. In a schedule of...
Using geographic information systems to assess the risks of hazardous materials transport in networks
Using geographic information systems to assess the risks of hazardous materials transport in networks
2000,
Routing hazardous materials (hazmat) wisely, and designing safer networks for doing...
Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs
Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs
2000,
We discuss valid inequalities for a variation of the capacitated minimum spanning tree...
Tabu search for minimizing total tardiness in a job shop
Tabu search for minimizing total tardiness in a job shop
2000,
This paper presents a tabu search approach to minimize total tardiness for the job...
A multiperiod planning model for the capacitated minimal spanning tree problem
A multiperiod planning model for the capacitated minimal spanning tree problem
2000,
The Multiperiod Capacitated Minimal Spanning Tree (MCMST) Problem consists of...
The overlapping production planning: A new approach of bounded capacity management
The overlapping production planning: A new approach of bounded capacity management
2000,
This paper presents a new load adjustment approach by overlapping, guaranteeing the...
A data envelopment analysis model for the efficiency evaluation of nondominated paths on a road network
A data envelopment analysis model for the efficiency evaluation of nondominated paths on a road network
2000,
We present a DEA application in evaluating the efficiency of a set of nondominated...
Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness
Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness
2000,
We study the scheduling of N jobs in a V -stage hybrid flow shop with identical...
Do long-memory models have long memory?
Do long-memory models have long memory?
2000,
This paper examines the predictability memory of fractionally integrated ARMA...
A branch-and-bound algorithm for the hybrid flowshop
A branch-and-bound algorithm for the hybrid flowshop
2000,
This paper introduces a branch-and-bound algorithm for the hybrid flowshop scheduling...
Integrated scheduling, assembly area- and part-assignment for large-scale, make-to-order assemblies
Integrated scheduling, assembly area- and part-assignment for large-scale, make-to-order assemblies
2000,
The problem of scheduling multiple, large-scale, make-to-order assemblies is...
A two-phase heuristic approach to the permutation flow-shop scheduling problem
A two-phase heuristic approach to the permutation flow-shop scheduling problem
2000,
In this study, the permutation flow-shop scheduling problem is considered. One of the...
Optimal start times under stochastic activity durations
Optimal start times under stochastic activity durations
2000,
We treat the problem of sequencing n activities on a single facility with the...
Shortest path problems with partial information: Models and algorithms for detecting dominance
Shortest path problems with partial information: Models and algorithms for detecting dominance
2000,
In this work we focus on partial information models for the well-known shortest path...
Shortest paths in a network with time-dependent flow speeds
Shortest paths in a network with time-dependent flow speeds
2000,
The model and solution of the shortest path problem on time-dependent networks, where...
Streets tree networks and urban growth: Optimal geometry for quickest access between a finite-size volume and one point
Streets tree networks and urban growth: Optimal geometry for quickest access between a finite-size volume and one point
1998,
The geometric form of the tree network is deduced from a single mechanism. The...
Finding the critical path in an activity network with time-switch constraints
Finding the critical path in an activity network with time-switch constraints
2000,
An activity network is an acyclic graph with non-negative weights and with a unique...
Corrections to rule-based forecasting: Findings from a replication
Corrections to rule-based forecasting: Findings from a replication
2000,
Rule-Based Forecasting (RBF) is an expert system that combines forecasts from simple...
Toward global optimization of neural networks: A comparison of the genetic algorithm and backpropagation
Toward global optimization of neural networks: A comparison of the genetic algorithm and backpropagation
1998,
The recent surge in activity of neural network research in business is not surprising...
A neural networks-based approach for strategic planning
A neural networks-based approach for strategic planning
1999,
We establish a systematic approach that incorporates neural networks in conjunction...
On optimal grid construction in numerical integration
On optimal grid construction in numerical integration
2000,
This paper presents an optimization approach to the construction of optimal grids for...
Papers per page: