Keyword: computational analysis

Found 489 papers in total
Scheduling unit length jobs with parallel nested machine processing set restrictions
Scheduling unit length jobs with parallel nested machine processing set restrictions
2006,
This article explores the impact of restricting the machines upon which individual...
A C++ computational environment for biomolecular sequence management
A C++ computational environment for biomolecular sequence management
2005,
The wide production of biomolecular data of the last 30 years, mainly due to the rapid...
Combinatorial optimization in DNA mapping – a computational thread of the Simplified Partial Digest Problem
Combinatorial optimization in DNA mapping – a computational thread of the Simplified Partial Digest Problem
2005,
In the paper, the problem of the genome mapping of DNA molecules is presented. In...
A simple approximation algorithm for WIS based on the approximability in k-partite graphs
A simple approximation algorithm for WIS based on the approximability in k-partite graphs
2006,
In this note, simple approximation algorithms for the weighted independent set problem...
Upper and lower bounding strategies for the generalized minimum spanning tree problem
Upper and lower bounding strategies for the generalized minimum spanning tree problem
2006,
We address the generalized minimum spanning tree problem which requires spanning at...
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
2006,
We consider the multiple shift scheduling problem modelled as a covering problem. Such...
Advances on measuring the operational complexity of supplier–customer systems
Advances on measuring the operational complexity of supplier–customer systems
2006,
Even structurally simple supplier–customer systems can be operationally complex....
Lower bounds for the relative greedy algorithm for approximating Steiner trees
Lower bounds for the relative greedy algorithm for approximating Steiner trees
2006,
The Steiner tree problem is to find a shortest subgraph that spans a given set of...
Simultaneous generalized hill-climbing algorithms for addressing sets of discrete optimization problems
Simultaneous generalized hill-climbing algorithms for addressing sets of discrete optimization problems
2005,
This paper introduces simultaneous generalized hill-climbing (SGHC) algorithms as a...
A computational study of cost reoptimization for min-cost flow problems
A computational study of cost reoptimization for min-cost flow problems
2006,
In the last two decades, a number of algorithms for the linear single-commodity...
Numerical solutions of renewal-type integral equations
Numerical solutions of renewal-type integral equations
2005,
The integral equation of renewal type has many applications in applied probability....
Early estimates of the size of branch-and-bound trees
Early estimates of the size of branch-and-bound trees
2006,
This paper intends to show that the time needed to solve mixed-integer-programming...
Multiple sequence alignment as a facility-location problem
Multiple sequence alignment as a facility-location problem
2004,
A connection is made between certain multiple-sequence alignment problems and...
Computer-aided complexity classification of dial-a-ride problem
Computer-aided complexity classification of dial-a-ride problem
2004,
In dial-a-ride problems, items have to be transported from a source to a destination....
Some insights into the solution algorithms for stochastic linear programming problems
Some insights into the solution algorithms for stochastic linear programming problems
2006,
We consider classes of stochastic linear programming problems which can be efficiently...
A review of traveling salesman problem based approaches for flowshop scheduling
A review of traveling salesman problem based approaches for flowshop scheduling
2006,
Contemporary flowshops that are variants of the classical flowshop frequently pose...
Complexity of flowshop scheduling problems with a new blocking constraint
Complexity of flowshop scheduling problems with a new blocking constraint
2006,
This article deals with makespan minimization in the flowshop scheduling problem under...
Scheduling orders for multiple product types with due date related objectives
Scheduling orders for multiple product types with due date related objectives
2006,
We consider m machines in parallel with each machine capable of producing one specific...
Flexible flow scheduling with uniform parallel machines
Flexible flow scheduling with uniform parallel machines
2006,
We consider the multistage flexible flow shop scheduling problem with uniform parallel...
Approximation schemes for job shop scheduling problems with controllable processing times
Approximation schemes for job shop scheduling problems with controllable processing times
2005,
In this paper we study the job shop scheduling problem under the assumption that the...
Complexity results for flow-shop problems with a single server
Complexity results for flow-shop problems with a single server
2005,
Flow-shop problems with a single server are generalizations of classical flow-shop...
The two-machine flow-shop problem with weighted late work criterion and common due date
The two-machine flow-shop problem with weighted late work criterion and common due date
2005,
The paper is on the two-machine non-preemptive flow-shop scheduling problem with a...
Positive half-products and scheduling with controllable processing times
Positive half-products and scheduling with controllable processing times
2005,
We study the single machine scheduling problem with controllable job processing times...
Scheduling unit execution time and unit communication delay outforests to minimize maximum lateness
Scheduling unit execution time and unit communication delay outforests to minimize maximum lateness
2005,
In this paper, a well known NP -hard problem with parallel processors, precedence...
Papers per page: