Keyword: heuristics

Found 5460 papers in total
Algorithms for dynamic scheduling of unit execution time tasks
Algorithms for dynamic scheduling of unit execution time tasks
2003,
We analyze performance properties of list scheduling algorithms under various dynamic...
Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
2003,
This paper considers minimizing the makespan in the “fixed, 3-machine,...
The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
2003,
This paper considers the flowshop scheduling problem with the objective of minimizing...
The concave cost supply problem
The concave cost supply problem
2003,
This paper is divided into two parts. In the first part, we consider the case where...
Integrated service network design for a cross-docking supply chain network
Integrated service network design for a cross-docking supply chain network
2003,
This paper considers an integrated service network design problem for a given set of...
A fuzzy genetic algorithm for driver scheduling
A fuzzy genetic algorithm for driver scheduling
2003,
This paper presents a hybrid genetic algorithm (GA) for the bi-objective public...
Vehicle routing problem with time windows and a limited number of vehicles
Vehicle routing problem with time windows and a limited number of vehicles
2003,
This paper introduces a variant of the vehicle routing problem with time windows where...
Optimal bandwith allocation for bandwidth adaptation in wireless multimedia networks
Optimal bandwith allocation for bandwidth adaptation in wireless multimedia networks
2003,
The concept of bandwidth adaptation which additionally allocates the terminated...
One-dimensional cutting stock problem to minimize the number of different patterns
One-dimensional cutting stock problem to minimize the number of different patterns
2003,
As the cost associated with the change of cutting patterns become more important in...
An evolutionary heuristic for the index tracking problem
An evolutionary heuristic for the index tracking problem
2003,
Index tracking is a popular form of passive fund management. The index tracking...
Constructing nurse schedules at large hospitals
Constructing nurse schedules at large hospitals
2003,
Several heuristics, based on evolutive algorithms and local search, are used to solve...
Solving a home-care districting problem in an urban setting
Solving a home-care districting problem in an urban setting
2003,
This article describes a districting study undertaken for the Côte-des-Neiges...
Component scheduling for chip shooter machines: a hybrid genetic algorithm approach
Component scheduling for chip shooter machines: a hybrid genetic algorithm approach
2003,
A chip shooter machine for electric component assembly has a movable feeder carrier, a...
Optimal new product positioning: A genetic algorithm approach
Optimal new product positioning: A genetic algorithm approach
2003,
Identifying an optimal position strategy for new products is a critical and difficult...
Differential approximation for optimal satisfiability and related problems
Differential approximation for optimal satisfiability and related problems
2003,
We study the differential approximability of several optimization satisfiability...
A memetic algorithm for minimum-cost vertex-biconnectivity augmentation of graphs
A memetic algorithm for minimum-cost vertex-biconnectivity augmentation of graphs
2003,
This paper considers the problem of augmenting a given graph by a cheapest possible...
A guided local search heuristic for the capacitated arc routing problem
A guided local search heuristic for the capacitated arc routing problem
2003,
This paper presents a new local search algorithm for the capacitated arc routing...
New formulations and solution procedures for the hop constrained network design problem
New formulations and solution procedures for the hop constrained network design problem
2003,
Optical fiber provides tremendous advantages in being able to carry a wide range of...
A heuristic for the continuous capacity and flow assignment
A heuristic for the continuous capacity and flow assignment
2003,
This work deals with the Continuous Capacity and Flow Assignment (CFA) problem for the...
An approximation algorithm for computing longest paths
An approximation algorithm for computing longest paths
2003,
We show that the color-coding method of Alon et al ., in its version specialized to...
Application of a mixed simulated annealing–genetic algorithm heuristic for the two-dimensional orthogonal packing problem
Application of a mixed simulated annealing–genetic algorithm heuristic for the two-dimensional orthogonal packing problem
2003,
In this paper a pure meta-heuristic (genetic algorithm) and a mixed meta-heuristic...
Large scale linear programs and heuristics for the design of survivable telecommunications networks
Large scale linear programs and heuristics for the design of survivable telecommunications networks
2003,
We consider the problem of providing a minimum cost multi-service network subject to...
Solving the shortest route cut and fill problem using simulated annealing
Solving the shortest route cut and fill problem using simulated annealing
2003,
This paper introduces the shortest route cut and fill problem (SRCFP). The SRCFP is an...
Minimization subproblems and heuristics for an applied clustering problem
Minimization subproblems and heuristics for an applied clustering problem
2003,
A practical problem that requires the classification of a set of points of ℝ n...
Papers per page: