Country: Netherlands

Found 18376 papers in total
Assembly line balancing in a mixed-model sequencing environment with synchronous transfers
2003,
We consider the assembly line balancing problem in a mixed-model line which is...
The MA-ordering max-flow algorithm is not strongly polynomial for directed networks
2004,
Quite recently Fujishige developed a weakly polynomial-time algorithm for the maximum...
Allocating electricity transmission costs through tracing: a game-theoretic rationale
2004,
Tracing is a method of assigning flows in an electricity network to particular...
An optimal algorithm to solve the all-pairs shortest paths problem on permutation graphs
2003,
In this paper we present an optimal algorithm to sove the all-pairs shortest path...
Sorting weighted distances with applications to objective function evaluations in single facility location problem
2004,
We consider single facility location problems on rectilinear spaces and spaces induced...
Randomized on-line scheduling on three processors
2004,
We consider a randomized on-line scheduling problem where each job has to be scheduled...
Improved lower bounds for the capacitated lot sizing problem with setup times
2004,
We present new lower bounds for the capacitated lot sizing problem, applying...
Preemptive scheduling of equal-length jobs to maximize weighted throughput
2004,
We study the problem of computing a preemptive schedule of equal-length jobs with...
Insertion techniques for static and dynamic resource-constrained project scheduling
2003,
A flow network model is presented for the static resource-constrained project...
Technical efficiency-based selection of learning cases to improve forecasting accuracy of neural networks under monotonicity assumption
2003,
In this paper, we show than when an artificial neural network (ANN) model is used for...
A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version
2003,
This paper describes new simulated annealing (SA) algorithms for the...
Simultaneous optimization of neural network function and architecture algorithm
2004,
A major limitation to current artificial neural network research is the inability to...
Resource-constrained project scheduling: A critical activity reordering heuristic
2003,
In this paper, we present a new metaheuristic algorithm for the resource-constrained...
Lower bounds for resource-constrained project scheduling problems
2003,
A destructive lower bound for the multi-mode resource-constrained project scheduling...
On linear lower bounds for the resource constrained project scheduling problem
2003,
The aim of this paper is to propose efficient methods for solving the resource...
Order-based neighborhoods for project scheduling with nonregular objective functions
2003,
This paper is concerned with project scheduling where scarce resources are taken into...
Gantt charts: A centenary appreciation
2003,
With the proliferation of microcomputer based project management packages Gantt charts...
Human resources selection for software development projects using Taguchi's parameter design
2003,
Resource selection for choosing a best project team at the planning stage of a...
Guidelines for the use of meta-heuristics in combinatorial optimization
2003,
the 18th EURO Summer/Winter Institute (ESWI XVIII) took place during the spring 2000...
Reliability of software with an operational profile
2003,
This article provides the stochastic and statistical framework to model software...
Software reliability and cost models: Perspectives, comparison, and practice
2003,
Computer software has gradually become an indispensable element in many aspects of our...
On the complexity of the primal self-concordant barrier method
2003,
The theory of self-concordance, initiated by Nesterov and Nemirovskii, has become very...
Three-triplet np control charts
2003,
An algorithm is presented for designing np control charts on the basis of their...
Lexicographic balanced optimization problems
2004,
We introduce the lexicographic balanced optimization problem (LBaOP) and show that it...
Papers per page: