Keyword: heuristics

Found 5460 papers in total
Approximation methods for discrete lot streaming in flow shops
Approximation methods for discrete lot streaming in flow shops
1997,
Lot streaming is the process of splitting a job or lot to allow overlapping between...
Design of interconnection of local area networks
Design of interconnection of local area networks
1998,
This paper addresses the interconnection of local area networks (LANs) using bridges....
Approximation algorithms for the oriented two-dimensional bin packing problem
Approximation algorithms for the oriented two-dimensional bin packing problem
1999,
Given a set of rectangular items which may not be rotated and an unlimited number of...
A tabu search algorithm for weakly heterogeneous container loading problems
A tabu search algorithm for weakly heterogeneous container loading problems
1998,
The paper presents a tabu search algorithm (TSA) for weakly heterogeneous container...
Approximation algorithms for maximum dispersion
Approximation algorithms for maximum dispersion
1997,
We describe approximation algorithms with bounded performance guarantees for the...
Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search
Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search
1999,
A decomposition approach to two-stage hybrid flow shop scheduling with diverging jobs
A decomposition approach to two-stage hybrid flow shop scheduling with diverging jobs
1998,
A two-stage hybrid flow shop associated with process industry is considered, in which...
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 optimization based heuristic for political districting
An optimization based heuristic for political districting
1998,
Redistricting, the redrawing of congressional district boundaries within the states,...
A branch and bound algorithm for the stability number of a sparse graph
A branch and bound algorithm for the stability number of a sparse graph
1998,
We present a branch and bound algorithm for finding a maximum stable set in a graph....
Flow shop no-wait scheduling with sequence dependent setup times and release dates
Flow shop no-wait scheduling with sequence dependent setup times and release dates
1999,
We consider the problem of scheduling no-wait jobs, with release dates and sequence...
A 7/6-approximation algorithm for 3-partitioning and its application to multiprocessor scheduling
A 7/6-approximation algorithm for 3-partitioning and its application to multiprocessor scheduling
1999,
The optimization version of the classical 3-partitioning problem is considered. 3 m...
Heuristics for generalized shop scheduling problems based on decomposition
Heuristics for generalized shop scheduling problems based on decomposition
1998,
In this paper we consider generalized shop scheduling problems, where arbitrary...
A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop
A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop
1999,
We present a shifting bottleneck heuristic for minimizing the total weighted tardiness...
A heuristic for the two-machine no-wait openshop scheduling problem
A heuristic for the two-machine no-wait openshop scheduling problem
1999,
In this paper the problem of minimizing makespan in a two-machine openshop is...
Optimal placement of add/drop multiplexers: Static and dynamic models
Optimal placement of add/drop multiplexers: Static and dynamic models
1998,
We study further a problem that has arisen recently in the design of...
4-Block heuristic for the rectangle packing problem
4-Block heuristic for the rectangle packing problem
1998,
In this paper the rectangle packing problem (RPP) is considered. The RPP consists in...
Simulated annealing for order spread minimization in sequencing cutting patterns
Simulated annealing for order spread minimization in sequencing cutting patterns
1998,
The Order Spread Minimization Problem (OSMP) is a sequencing problem that arises in...
Heuristic and exact methods for the cutting sequencing problem
Heuristic and exact methods for the cutting sequencing problem
1998,
Cutting stock problems deal with the generation of a set of cutting patterns that...
Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study
Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study
1998,
Sensitivity or post-optimality analysis investigates the effect of parametric changes...
A meta-heuristic satisficing tradeoff method for solving multiple criteria combinatorial optimization problem
A meta-heuristic satisficing tradeoff method for solving multiple criteria combinatorial optimization problem
1998,
In this paper a meta-heuristic satisficing tradeoff method for solving multiple...
Modeling and solving a real-life assignment problem at universities
Modeling and solving a real-life assignment problem at universities
1998,
A real-life problem of assigning students to exams during an examination period is...
Iterative improvement methods for a multiperiod network design problem
Iterative improvement methods for a multiperiod network design problem
1998,
We address an important problem in telecommunications planning: the multiperiod...
An efficient composite heuristic for the symmetric generalized traveling salesman problem
An efficient composite heuristic for the symmetric generalized traveling salesman problem
1998,
The main purpose of this paper is to introduce a new comnposite heuristic for solving...
Papers per page: