Keyword: combinatorial analysis

Found 435 papers in total
On a standard time transportation problem
On a standard time transportation problem
1999,
This paper studies a standard time transportation problem. Parallel transportation is...
Determination of optimal path under approach and exit constraints
Determination of optimal path under approach and exit constraints
1999,
To economize machining process used in component manufacturing a number of procedures...
Worst-case performance of approximation algorithms for tool management problems
Worst-case performance of approximation algorithms for tool management problems
1999,
Since the introduction of flexible manufacturing systems, researchers have...
The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine
The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine
1999,
The problem of interest is to schedule two types of jobs on a two-stage flowshop with...
One-operator–two-machine flowshop scheduling with setup and dismounting times
One-operator–two-machine flowshop scheduling with setup and dismounting times
1999,
In this paper we study the problem of scheduling n jobs in a...
The time dependent machine makespan problem is strongly NP-complete
The time dependent machine makespan problem is strongly NP-complete
1999,
The computational complexity of the problem of scheduling a set of start-time...
The Steiner ratio of ℒd2k
The Steiner ratio of ℒd2k
1999,
Let ℒ d 2k be the d -dimensional space with 2 k -norm. Given a finite set N of...
Solving the k-best traveling salesman problem
Solving the k-best traveling salesman problem
1999,
Although k -best solutions for polynomial solvable problems are extensively studied in...
Structural shape optimization using evolution strategies
Structural shape optimization using evolution strategies
1999,
The objective of this paper is to investigate the efficiency of combinatorial...
Minimising bins in transmission systems
Minimising bins in transmission systems
1999,
This paper deals with the problem of minimising the transmission cost in an electronic...
The mystical power of twoness: In memoriam Eugene L. Lawler
The mystical power of twoness: In memoriam Eugene L. Lawler
1998,
This paper reviews the work of Eugene L. Lawler, one of the early investigators of...
Approximation schemes for scheduling on parallel machines
Approximation schemes for scheduling on parallel machines
1998,
We discuss scheduling problems with m identical machines and n jobs where each job has...
Minimizing symmetric submodular functions
Minimizing symmetric submodular functions
1998,
We describe a purely combinatorial algorithm which, given a submodular set function f...
Localizer: A modeling language for local search
Localizer: A modeling language for local search
1999,
Local search is a traditional technique to solve combinatorial search problems and has...
Neural networks for combinatorial optimization: A review of more than a decade of research
Neural networks for combinatorial optimization: A review of more than a decade of research
1999,
It has been over a decade since neural networks were first applied to solve...
The parsimonious property of cut covering problems and its applications
The parsimonious property of cut covering problems and its applications
1997,
We consider the analysis of linear programming relaxations of a large class of...
A dynamic search method for jobshop scheduling using Lagrange relaxation method and genetic algorithms
A dynamic search method for jobshop scheduling using Lagrange relaxation method and genetic algorithms
1998,
This paper deals with an approximate solution method by decomposing a search space...
An efficient algorithm for the minimum-range ideal problem
An efficient algorithm for the minimum-range ideal problem
1999,
Suppose we are given a partially ordered set, a real-valued weight associated with...
Pareto simulated annealing – a metaheuristic technique for multiple-objective combinatorial optimization
Pareto simulated annealing – a metaheuristic technique for multiple-objective combinatorial optimization
1998,
This paper presents a multiple-objective metaheuristic procedure – Pareto...
Compact scheduling in open shop with zero–one time operations
Compact scheduling in open shop with zero–one time operations
1999,
A problem of no-wait scheduling of zero–one time operations in an open shop...
Discrete lot streaming in two-machine flow shops
Discrete lot streaming in two-machine flow shops
1999,
Lot streaming is the process of splitting a job or lot to allow overlapping between...
A genetic algorithm methodology for complex scheduling problems
A genetic algorithm methodology for complex scheduling problems
1999,
This paper considers the scheduling problem to minimize total tardiness given multiple...
Efficiency of interactive multi-objective simulated annealing through a case study
Efficiency of interactive multi-objective simulated annealing through a case study
1998,
We have previously developed an adaptation of the simulated annealing for...
A simple and effective recursive procedure for the manufacturer's pallet loading problem
A simple and effective recursive procedure for the manufacturer's pallet loading problem
1998,
In this paper we present a simple and effective heuristic to solve the problem of...
Papers per page: