Keyword: combinatorial analysis

Found 435 papers in total
Convex resource allocation for minimizing the makespan in a single machine with job release dates
Convex resource allocation for minimizing the makespan in a single machine with job release dates
2004,
We consider the problem of scheduling jobs on a single machine where job-processing...
Approximation schemes for parallel machine scheduling problems with controllable processing times
Approximation schemes for parallel machine scheduling problems with controllable processing times
2004,
We consider the problem of scheduling n independent jobs on m identical machines that...
Equal processing and equal setup time cases of scheduling parallel machines with a single server
Equal processing and equal setup time cases of scheduling parallel machines with a single server
2004,
This paper considers the deterministic problem of scheduling two-operation...
Parallel machine scheduling under a grade of service provision
Parallel machine scheduling under a grade of service provision
2004,
We consider the problem of scheduling parallel machines that process service requests...
Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay
Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay
2004,
We consider the makespan minimization for a unit execution time task sequencing...
On the complexity of the k-customer vehicle routing problem
On the complexity of the k-customer vehicle routing problem
2005,
We investigate the complexity of the k -customer vehicle routing problem: Given an...
Worst-case behavior of the maximum vertex covering algorithm heuristic for the minimum labeling spanning tree problem
Worst-case behavior of the maximum vertex covering algorithm heuristic for the minimum labeling spanning tree problem
2005,
In this paper, we review recent work on the minimum labeling spanning tree problem and...
Analysis of algorithms for two-stage flowshops with multi-processor task flexibility
Analysis of algorithms for two-stage flowshops with multi-processor task flexibility
2004,
In this article we introduce a 2-machine flowshop with processing flexibility. Two...
On Gilmore–Gomory's open question for the bottleneck TSP
On Gilmore–Gomory's open question for the bottleneck TSP
2003,
Consider the traveling salesman problem where the distance between two cities A and B...
On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
2004,
In this paper, the complexity and some other properties of several multi-stage...
Insertion of a random bitask in a schedule: a real-time approach
Insertion of a random bitask in a schedule: a real-time approach
2004,
We consider a schedule of bitasks. A bitask is a pair of tasks separated by an idle...
On the complexity of the robust spanning tree problem with interval data
On the complexity of the robust spanning tree problem with interval data
2004,
This paper studies the complexity of the robust spanning tree problem with interval...
Worst-case analysis of the subset sum algorithm for bin packing
Worst-case analysis of the subset sum algorithm for bin packing
2004,
We analyze the worst-case ratio of a natural heuristic for the bin packing problem,...
On bottleneck assignment problems under categorization
On bottleneck assignment problems under categorization
2004,
In this note we consider two types of bottleneck assignment problems under...
A branch & bound algorithm for the 0–1 mixed integer knapsack problem with linear multiple choice constraints
A branch & bound algorithm for the 0–1 mixed integer knapsack problem with linear multiple choice constraints
2004,
This paper presents a branch and bound (B&B) algorithm for the 0–1 mixed...
A note on maximizing a submodular set function subject to a knapsack constraint
A note on maximizing a submodular set function subject to a knapsack constraint
2004,
In this paper, we obtain an (1-e -1 )-approximation algorithm for maximizing a...
Team formation: Matching quality supply and quality demand
Team formation: Matching quality supply and quality demand
2003,
One of the problems in sports and human resources management is the scouting or...
A note on scheduling multiprocessor tasks with identical processing times
A note on scheduling multiprocessor tasks with identical processing times
2003,
We study the scheduling situation where n tasks with identical processing times have...
Linear-time algorithms for computing the reliability of bipartite and (# ⩽ 2) star distributed computing systems
Linear-time algorithms for computing the reliability of bipartite and (# ⩽ 2) star distributed computing systems
2003,
Let S =( V, F ) denote a distributed computing system with star topology, where...
Single machine scheduling with a variable common due date and resource-dependent processing times
Single machine scheduling with a variable common due date and resource-dependent processing times
2003,
The problem of scheduling n jobs with a variable common due date on a single machine...
A note on the maximum number of on-time jobs on parallel identical machines
A note on the maximum number of on-time jobs on parallel identical machines
2003,
This note addresses the scheduling problem of minimizing the number of on-time jobs....
Exact algorithms for scheduling multiple families of jobs on parallel machines
Exact algorithms for scheduling multiple families of jobs on parallel machines
2003,
In many practical manufacturing environments, jobs to be processed can be divided into...
A branch-and-bound-based local search method for the flow shop problem
A branch-and-bound-based local search method for the flow shop problem
2003,
It is well-known that exact branch and bound methods can only solve small or...
Reducing off-line to on-line: an example and its applications
Reducing off-line to on-line: an example and its applications
2003,
We study on-line versions of maximum weighted hereditary subgraph problems for which...
Papers per page: