Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Crane Sequencing Problem (1)
- Dynamic facility layout problem; Hybrid ant system; Ant colonies; Simulated annealing; Heuristics (1)
- Dynamic facility layout problem; Simulated annealing; Heuristics; Look-ahead/back strategy (1)
- Dynamic space allocation problem; Tabu search; Clustering algorithms; Randomized storage policy (1)
- Electric Power Plants (1)
Articles 1 - 4 of 4
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Hybrid Ant Systems For The Dynamic Facility Layout Problem, Alan Mckendall, Jin Shang
Hybrid Ant Systems For The Dynamic Facility Layout Problem, Alan Mckendall, Jin Shang
Faculty & Staff Scholarship
Today’s consumer market demands that manufacturers must be competitive. This requires the efficient operation of manufacturing plants and their ability to quickly respond to changes in product mix and demand. In addition, studies show that material-handling cost make up between 20 and 50 percent of the total operating cost. Therefore, this paper considers the problem of arranging and rearranging, when there are changes in product mix and demand, manufacturing facilities such that the sum of material handling and rearrangement costs is minimized. This problem is called the dynamic facility layout problem (DFLP). In this paper, hybrid ant systems (HASs) are …
Simulated Annealing Heuristics For The Dynamic Facility Layout Problem, Alan Mckendall, Jin Shang, Saravanan Kuppusamy
Simulated Annealing Heuristics For The Dynamic Facility Layout Problem, Alan Mckendall, Jin Shang, Saravanan Kuppusamy
Faculty & Staff Scholarship
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 problem of arranging and rearranging (when there are changes between the flows of materials between departments) manufacturing facilities such that the sum of the material handling and rearrangement costs is minimized. This problem is known as the dynamic facility layout problem (DFLP). In this paper, two simulated annealing (SA) heuristics are developed for the DFLP. The first SA heuristic (SAI) is a direct adaptation of SA to the DFLP. The second SA heuristic(SAII) is …
A Simulated Annealing Heuristic For A Crane Sequencing Problem, Alan Mckendall, Jin Shang, James Noble, Cerry Klein
A Simulated Annealing Heuristic For A Crane Sequencing Problem, Alan Mckendall, Jin Shang, James Noble, Cerry Klein
Faculty & Staff Scholarship
When maintenance activities during outages at electric power plants are scheduled using project management software, the locations of the resources required to perform the activities are determined such that the total distance the resources travel during the outage is minimized. This problem is defined as the dynamic space allocation problem (DSAP). Once the DSAP solution (i.e., assignment of activities and their required resources to workspaces and of idle resources to storage spaces) is obtained, the problem then is to determine the sequence in which the crane moves the resources to their required locations at the beginning of each period (i.e., …
A Tabu Search Heuristic For The Dynamic Space Allocation Problem, Alan Mckendall, Juan Jaramillo
A Tabu Search Heuristic For The Dynamic Space Allocation Problem, Alan Mckendall, Juan Jaramillo
Faculty & Staff Scholarship
The dynamic space allocation problem(DSAP) presented here is a relatively new problem in the literature. It looks at the optimization of space/resource assignments during the implementation of project activities. More specifically, the DSAP assigns project activities and their required resources to workspaces and idle resources to storage spaces with respect to minimizing the sum of the distances the resources travel. In this paper, construction algorithms and a tabu search heuristic are presented for the DSAP, and a set of test problems taken from the literature is used to test the performances of the heuristics. The results show that the proposed …