Keyword: computational analysis

Found 489 papers in total
Scheduling batches with sequential job processing for two-machine flow and open shops
Scheduling batches with sequential job processing for two-machine flow and open shops
2001,
In this paper, we study a problem of scheduling and batching on two machines in a...
Non-approximability results for scheduling problems with minsum criteria
Non-approximability results for scheduling problems with minsum criteria
2001,
We provide several non-approximability results for deterministic scheduling problems...
Fast heuristics for the maximum feasible subsystem problem
Fast heuristics for the maximum feasible subsystem problem
2001,
Given an infeasible set of linear constraints, finding the maximum cardinality...
The bounded cycle-cover problem
The bounded cycle-cover problem
2001,
We consider the bounded cycle-cover problem, which is to find a minimum cost cycle...
Flow pack facets of the single node fixed-charge flow polytope
Flow pack facets of the single node fixed-charge flow polytope
2001,
We present a class of facet-defining inequalities for the single node fixed-charge...
Lower bounds for multiplayer noncooperative games of incomplete information
Lower bounds for multiplayer noncooperative games of incomplete information
2001,
This paper extends the alternating Turing machine (A-TM) of Chandra, Kozen and...
A computational analysis of balanced just-in-time optimization algorithms
A computational analysis of balanced just-in-time optimization algorithms
2001,
The balanced schedule problem in mixed-model, JIT manufacturing is examined. Solving...
A tabu search algorithm for the site dependent vehicle routing problem with time windows
A tabu search algorithm for the site dependent vehicle routing problem with time windows
2001,
This paper shows that the Site Dependent Vehicle Routing Problem (SDVRP) can be viewed...
Minimum-weight spanning tree algorithms: A survey and empirical study
Minimum-weight spanning tree algorithms: A survey and empirical study
2001,
The minimum-weight spanning tree problem is one of the most typical and well-known...
The complexity of irredundant sets parameterized by size
The complexity of irredundant sets parameterized by size
2000,
An irredundant set of vertices V′⊆V in a graph G=(V,E) has the property...
Algorithmic aspects of clique-transversal and clique-independent sets
Algorithmic aspects of clique-transversal and clique-independent sets
2000,
A minimum clique-transversal set MCT(G) of a graph G = (V,E) is a set S⊆V of...
Algorithms and codes for dense assignment problems: The state of the art
Algorithms and codes for dense assignment problems: The state of the art
2000,
The paper considers the classic linear assignment problem with a min-sum objective...
The distributed program reliability analysis on ring-type topologies
The distributed program reliability analysis on ring-type topologies
2001,
Distributed computing system (DCS) has become very popular for its high...
Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
2001,
We consider a scheduling problem where a set of jobs are simultaneously available for...
Stack-up algorithms for palletizing at delivery industry
Stack-up algorithms for palletizing at delivery industry
2001,
We study the following multi-objective combinatorial stack-up problem from delivery...
Machine scheduling with a rate-modifying activity
Machine scheduling with a rate-modifying activity
2001,
Motivated by a problem commonly found in electronic assembly lines, this paper deals...
Two-stage open shop scheduling with a bottleneck machine
Two-stage open shop scheduling with a bottleneck machine
2001,
It is known that for the open shop scheduling problem to minimize the makespan there...
NP-hardness of compact scheduling in simplified open and flow shops
NP-hardness of compact scheduling in simplified open and flow shops
2001,
In practical task scheduling it is sometimes required that the components of a system...
A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
2001,
We consider the three-machine permutation flow-shop scheduling problem with release...
Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models
Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models
2000,
We present new algorithms for the solution of large structured Markov models whose...
Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting
Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting
2000,
In this paper, we consider a network design problem arising in the context of...
An ant colony system hybridized with a new local search for the sequential ordering problem
An ant colony system hybridized with a new local search for the sequential ordering problem
2000,
We present a new local optimizer called SOP-3-exchange for the sequential ordering...
Solving graph bisection problems with semidefinite programming
Solving graph bisection problems with semidefinite programming
2000,
An exact solution method for the graph bisection problem is presented. We describe a...
Market split and basis reduction: Towards a solution of the Cornuejols–Dawande instances
Market split and basis reduction: Towards a solution of the Cornuejols–Dawande instances
2000,
Cornuejols and Dawande proposed a set of 0–1 linear programming instances that...
Papers per page: