Sciweavers

Share
13 search results - page 1 / 3
» Simulated annealing heuristics for the dynamic facility layo...
Sort
View
COR
2006
118views more  COR 2006»
8 years 4 months ago
Simulated annealing heuristics for the dynamic facility layout problem
In today's economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in product mix and demand. Therefore, this paper considers the pro...
Alan R. McKendall Jr., Jin Shang, Saravanan Kuppus...
EOR
2002
67views more  EOR 2002»
8 years 4 months ago
Solving the multiple competitive facilities location problem
In this paper we propose five heuristic procedures for the solution of the multiple competitive facilities location problem. A franchise of several facilities is to be located in ...
Tammy Drezner, Zvi Drezner, Said Salhi
JVA
2006
IEEE
8 years 10 months ago
Simulated Annealing for Grid Scheduling Problem
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
Stefka Fidanova
COR
2006
80views more  COR 2006»
8 years 4 months ago
Multiple crossdocks with inventory and time windows
Crossdocking studies have mostly been concerned with the physical layout of a crossdock or on a single crossdock. In this work, we study a network of crossdocks taking into consid...
Ping Chen, Yunsong Guo, Andrew Lim, Brian Rodrigue...
IJMC
2006
84views more  IJMC 2006»
8 years 4 months ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
books