Keyword: heuristics

Found 5460 papers in total
Two-stage heuristic algorithms for part input sequencing in flexible manufacturing systems
Two-stage heuristic algorithms for part input sequencing in flexible manufacturing systems
2001,
This paper focuses on a part input sequencing problem in flexible manufacturing...
The multi-product, economic lot-sizing problem in flow shops: The powers-of-two heuristic
The multi-product, economic lot-sizing problem in flow shops: The powers-of-two heuristic
2001,
This paper presents a new and efficient heuristic to solve the multi-product,...
Tabu search for a class of single-machine scheduling problems
Tabu search for a class of single-machine scheduling problems
2001,
In this paper we develop a tabu search-based solution procedure designed specifically...
Selection and sequencing heuristics to reduce variance in gas turbine engine nozzle assemblies
Selection and sequencing heuristics to reduce variance in gas turbine engine nozzle assemblies
2001,
During the maintenance of gas turbine engines, the selection and placement of nozzle...
Flowshop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
Flowshop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
2001,
We consider two problems of m -machine flowshop scheduling in this paper: one, with...
A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
2001,
This article proposes lower bounds, as well as a divide and merge heuristic for the...
A new dominance rule to minimize total weighted tardiness with unequal release dates
A new dominance rule to minimize total weighted tardiness with unequal release dates
2001,
We present a new dominance rule by considering the time-dependent orderings between...
A shifting bottleneck approach for a parallel-machine flowshop scheduling problem
A shifting bottleneck approach for a parallel-machine flowshop scheduling problem
2001,
This paper considers a scheduling problem of minimizing the maximum lateness for a...
A fast algorithm for two-dimensional pallet loading problems of large size
A fast algorithm for two-dimensional pallet loading problems of large size
2001,
This paper concerns the two-dimensional pallet loading problem (PLP), which requires...
Planning and coordination of production and distribution facilities for multiple commodities
Planning and coordination of production and distribution facilities for multiple commodities
2001,
We study an integrated logistics model for locating production and distribution...
A compromise solution to mutual funds portfolio selection with transaction costs
A compromise solution to mutual funds portfolio selection with transaction costs
2001,
This paper considers the portfolio selection problem with transaction costs which are...
The problem of highly constrained tasks in group decision support systems
The problem of highly constrained tasks in group decision support systems
2001,
Most experimental uses of group decision support systems (GDSS) are associated with...
Greedy solutions of selection and ordering problems
Greedy solutions of selection and ordering problems
2001,
The greedy method is a well-known technique for approaching problems involving the...
Incremental bipartite drawing problem
Incremental bipartite drawing problem
2001,
Layout strategies that strive to preserve perspective from earlier drawings are called...
Reducing the bandwidth of a sparse matrix with tabu search
Reducing the bandwidth of a sparse matrix with tabu search
2001,
The bandwidth of a matrix A= { a ij } is defined as the maximum absolute difference...
A multi-period network design problem for cellular telecommunication systems
A multi-period network design problem for cellular telecommunication systems
2001,
Mathematical Programming models for multi-period network design problems, which arise...
On the design problem of multitechnology networks
On the design problem of multitechnology networks
2001,
In this article we propose a model for the topological design problem of...
Octane: A new heuristic for pure 0–1 programs
Octane: A new heuristic for pure 0–1 programs
2001,
We propose a new heuristic for pure 0–1 programs, which finds feasible integer...
Assigning pupils to tutor groups in a comprehensive school
Assigning pupils to tutor groups in a comprehensive school
2001,
Comprehensive schools in the UK have the annual task of assigning their intake of new...
A Tabu search heuristic for the generalized assignment problem
A Tabu search heuristic for the generalized assignment problem
2001,
This paper considers the generalized assignment problem (GAP). It is a well-known...
A note on distributed multicast routing in point-to-point networks
A note on distributed multicast routing in point-to-point networks
2001,
The distributed algorithm for a multicast connection set-up, based on the...
Optimal locations of switches and interconnections for asynchronous transfer mode local area networks
Optimal locations of switches and interconnections for asynchronous transfer mode local area networks
2001,
Setting up an ATM LAN with such equipment as ATM switches and cables is known to be of...
Algorithmical approaches to business process design
Algorithmical approaches to business process design
2001,
The paper introduces formal models of the business process design problem, which can...
Genetic clustering algorithms
Genetic clustering algorithms
2001,
This study employs genetic algorithms to solve clustering problems. Three models,...
Papers per page: