Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Industrial Engineering (53)
- Mechanical Engineering (16)
- Systems Engineering (15)
- Other Operations Research, Systems Engineering and Industrial Engineering (11)
- Ergonomics (10)
-
- Operational Research (9)
- Medicine and Health Sciences (8)
- Chemical Engineering (6)
- Energy Systems (6)
- Manufacturing (6)
- Electrical and Computer Engineering (5)
- Public Health (5)
- Occupational Health and Industrial Hygiene (4)
- Other Engineering (4)
- Risk Analysis (4)
- Civil and Environmental Engineering (3)
- Computer Engineering (3)
- Industrial Technology (3)
- Physical Sciences and Mathematics (3)
- Business (2)
- Computer-Aided Engineering and Design (2)
- Engineering Education (2)
- Materials Science and Engineering (2)
- Mining Engineering (2)
- Operations and Supply Chain Management (2)
- Other Chemical Engineering (2)
- Other Mechanical Engineering (2)
- Power and Energy (2)
- Keyword
-
- Machine Learning (5)
- Optimization (5)
- Simulated Annealing (5)
- Simulation (4)
- Deep Learning (3)
-
- Energy Efficiency (3)
- Gloves (3)
- Industry 4.0 (3)
- Meta-heuristic (3)
- Robotics (3)
- Smart Manufacturing (3)
- Additive Manufacturing (2)
- Additive manufacturing (2)
- Artificial Intelligence (2)
- Autonomy (2)
- Directed energy deposition (2)
- Electric Power Plants (2)
- Energy Consumption (2)
- Engineering (2)
- Fitts’ Law (2)
- Machine learning (2)
- Modeling (2)
- Multivariate Time Series (2)
- Musculoskeletal disorders (2)
- Outage Planning (2)
- Planning (2)
- Respirator (2)
- Respirators (2)
- Shoulder (2)
- Smart manufacturing (2)
- Publication Year
- Publication
- Publication Type
Articles 91 - 97 of 97
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Tabu Search Heuristics For The Crane Sequencing Problem, Alan Mckendall
Tabu Search Heuristics For The Crane Sequencing Problem, Alan Mckendall
Faculty & Staff Scholarship
Determining the sequence of relocating items (or resources) moved by a crane from existing positions to newly assigned locations during a multiperiod planning horizon is a complex combinatorial optimisation problem, which exists in power plants, shipyards, and warehouses. Therefore, it is essential to develop a good crane route technique to ensure efficient utilisation of the crane as well as to minimize the cost of operating the crane. This problem was defined as the Crane Sequencing Problem (CSP). In this paper, three construction and three improvement algorithms are presented for the CSP. The first improvement heuristic is a simple Tabu Search …
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 …
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 …
Simulated Annealing Heuristics For Managing Resources During Planned Outages At Electric Power Plants, Alan Mckendall, James Noble, Cerry Klein
Simulated Annealing Heuristics For Managing Resources During Planned Outages At Electric Power Plants, Alan Mckendall, James Noble, Cerry Klein
Faculty & Staff Scholarship
This paper presents a mathematical model and simulated annealing heuristics for assigning activities to workspaces and resources (e.g., equipment, parts, and toolboxes) to work/storage spaces during planned outages at electric power plants. These assignments are made such that the distance resources (toolboxes) travel throughout the duration of the outage is minimized. This problem is de2ned as the dynamic space allocation problem. To test the performance of the proposed techniques, a data set is generated and used in the analysis. The results show that the simulated annealing heuristics perform well with respect to solution quality and computational time.
Facility Layout Of Irregular-Shaped Departments Using A Nested Approach, Alan Mckendall, James Noble, Cerry Klein
Facility Layout Of Irregular-Shaped Departments Using A Nested Approach, Alan Mckendall, James Noble, Cerry Klein
Faculty & Staff Scholarship
The facility layout problem is a very difficult and widely studied optimization problem. As a result, many facility layout models and techniques have been developed. However, the literature does not fully consider or control irregular-shaped departments. In this paper, the nested facility layout problem is defined whereby irregular-shaped departments(i.e. L-shaped, O-shaped or U-shaped) can be generated and controlled. This is a unique problem that can be used to efficiently layout workstations, storage areas and other departments within departments, while arranging the departments with respect to an objective. The objective considered here is to minimize material handling cost. We present a …