Keyword: computational analysis

Found 489 papers in total
Single-machine scheduling with periodic maintenance to minimize makespan
Single-machine scheduling with periodic maintenance to minimize makespan
2007,
We consider a single-machine scheduling problem with periodic maintenance activities....
Hardness of approximation minimum (or maximum) maximal induced matching graph problems
Hardness of approximation minimum (or maximum) maximal induced matching graph problems
2007,
The minimum (respectively, maximum) maximal induced matching problem asks for a...
On optimality of one-bug-look-ahead policies for a software testing model
On optimality of one-bug-look-ahead policies for a software testing model
2007,
The optimality of the One-Bug-Look-Ahead (OLA) software release policy proposed by...
The approximation gap for the metric facility location problem is not yet closed
The approximation gap for the metric facility location problem is not yet closed
2007,
We consider the 1.52-approximation algorithm of Mahdian et al. for the metric...
SOR '07 Proceedings
SOR '07 Proceedings
2007,
The Slovenian Society ‘Informatika’ has a section for Operational...
SOR '07 Proceedings
SOR '07 Proceedings
2007,
The Slovenian Society ‘Informatika’ has a section for Operational...
SOR '07 Proceedings
SOR '07 Proceedings
2007,
The Slovenian Society ‘Informatika’ has a section for Operational...
A fully polynomial time approximation scheme for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
A fully polynomial time approximation scheme for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
2007,
Given a network with capacities and transit times on the arcs, the quickest flow...
Minimizing total flow time and total completion time with immediate dispatching
Minimizing total flow time and total completion time with immediate dispatching
2007,
We consider the problem of scheduling jobs arriving over time in a multiprocessor...
Real-time scheduling with a budget
Real-time scheduling with a budget
2007,
Suppose that we are given a set of jobs, where each job has a processing time, a...
The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard
The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard
2003,
In this paper, we consider the single machine batching problem with family setup times...
Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
2004,
One of the first problems to be studied in scheduling theory was the problem of...
Maximizing the total profit of rectangles packed into a rectangle
Maximizing the total profit of rectangles packed into a rectangle
2007,
We consider the following rectangle packing problem. Given a set of rectangles, each...
The greedy algorithm for the symmetric traveling salesman problem
The greedy algorithm for the symmetric traveling salesman problem
2007,
We corrected proofs of two results on the greedy algorithm for the Symmetric TSP and...
Bioinformatics and management science: some common tools and techniques
Bioinformatics and management science: some common tools and techniques
2004,
In April of 2003, Science (2003) and Nature (2003) published special issues marking...
Job shop scheduling with unit length tasks: bounds and algorithms
Job shop scheduling with unit length tasks: bounds and algorithms
2007,
We consider the job shop scheduling problem unit–J m , where each job is...
On the Internet routing protocol Enhanced Interior Gateway Routing Protocol: is it optimal?
On the Internet routing protocol Enhanced Interior Gateway Routing Protocol: is it optimal?
2006,
Cisco's proprietary routing protocol, EIGRP (Enhanced Interior Gateway Routing...
Vertex 3-colorability of claw-free graphs
Vertex 3-colorability of claw-free graphs
2007,
The 3-colorability problem is NP-complete in the class of claw-free graphs. In this...
Hybrid Continuous Interacting Ant Colony aimed at enhanced global optimization
Hybrid Continuous Interacting Ant Colony aimed at enhanced global optimization
2007,
Ant colony algorithms are a class of metaheuristics which are inspired from the...
On-line network synthesis
On-line network synthesis
2007,
We consider on-line network synthesis problems. Let N = {1, , n} be a set of n sites....
‘Binarize and Project’ to generate cuts for general mixed-integer programs
‘Binarize and Project’ to generate cuts for general mixed-integer programs
2007,
We consider mixed-integer linear programs with arbitrary bounded integer variables. We...
Privatized rural postman problems
Privatized rural postman problems
2006,
In this work we analyze the privatized rural postman problem which is the edge version...
New lower bound for the Capacitated Arc Routing Problem
New lower bound for the Capacitated Arc Routing Problem
2006,
We present a new lower bound, the Multiple Cuts Node Duplication Lower Bound, for the...
Minimizing the earliness–tardiness costs on a single machine
Minimizing the earliness–tardiness costs on a single machine
2006,
In this paper the one-machine scheduling problem with linear earliness and tardiness...
Papers per page: