Keyword: heuristics

Found 5460 papers in total
Flowshop scheduling with dominant machines
1995,
This paper examines two special cases of the n- job, m- machine permutation scheduling...
Heuristics for operator scheduling in group technology cells
1995,
Heuristic approaches were devised for operator scheduling in manned Grouped Technology...
A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs
1995,
Given a set of identical parallel machines and a set of jobs with different due dates...
Flow-shop scheduling with flexible processors
1995,
The authors consider a permutation flow-shop where one or more processors is flexible....
A backward approach in list scheduling algorithms for multi-machine tardiness problems
1995,
List scheduling algorithms are commonly used for multi-machine scheduling problems,...
A note on improving the performance of the enhanced dynamic cycle lengths heuristic for the multi-item, single machine scheduling problem
1995,
A comparison of different heuristics to schedule the multi-item, single-machine...
Optimization of cube-per-order index warehouse layouts with zoning constraints
1995,
Zoning constraints impose co-location of the storage addresses assigned to individual...
A repeated matching heuristic for the vehicle routeing problem
1994,
A new heuristic for the vehicle routeing problem which makes use of repeated matching...
Microcomputer-based heuristic approach to vehicle routing for after-sales servicing
1995,
A heuristic approach, based on a microcomputer, for solving vehicle routing problem...
A heuristic for purchasing of sheet metal decisions based on mathematical programming
1994,
An operational research project at the Oskarshamn plant of Saab Scania AB...
A dynamic distribution method composed of mathematical programming and heuristic method and its application to water management
1994,
This paper describes a two-step method for a dynamic water distribution considering...
An approximate solution method for combinatorial optimization. Hybrid approach of genetic algorithm and Lagrange relaxation method
1994,
In this paper the authors deal with an efficient method for obtaining a suboptimal...
An efficient pruning algorithm for value independent knapsack problem using a DAG structure
1995,
In this paper, the authors propose an efficient pruning algorithm to solve the value...
On the significance of the initial solution in travelling salesman heuristics
1994,
The quality requirements set by edge excahnge herusitics on their initial solutions...
A restricted-entry method for a transportation problem with piecewise-linear concave costs
1994,
This paper presents a heuristic solution method for a transportation problem with...
Heuristic optimization of rough-mill yield with production priorities
1991,
Efficient lumber utilization at the saw has become a key issue in the woodworking...
Timetabling county cricket fixtures using a form of tabu search
1994,
This paper concerns a computer system which has been devised to timetable the county...
A genetic algorithm for public transport driver scheduling
1995,
The problem of constructing daily shifts for public transport (generally bus) drivers...
A greedy look-ahead heuristic for combinatorial optimization: An application to vehicle scheduling with time windows
1994,
This paper describes a greedy heuristic for a class of combinatorial optimization...
Modeling and heuristic worst-case performance analysis of the Two-level Network Design problem
1994,
This paper studies a multi-facility network synthesis problem, called the Two-level...
A review of combinatorial problems arising in feedforward neural network design
1994,
This paper is primarily oriented towards discrete mathematics and emphasizes the...
Manufacturing cell design using simulated annealing-An industrial application
1990,
In this paper, the authors give a brief summary of simulated annealing (SA) procedures...
A simple 0.5-bounded greedy algorithm for the 0/1 knapsack-problem
1992,
The Non-Increasing First Fit (NIFF) greedy algorithm for the 0/1 knapsack problem does...
Tabu search within a Pivot and Complement framework
1994,
The Pivot and Complement heuristic is a procedure that frequently finds feasible...
Papers per page: