Abstract
The scheduling problem in manufacturing is considered as among the toughest to solve. The basic drawback of many proposed methods has been the huge amount of computation time for simulation. This paper proposes a framework to solve the operation allocation problem in automated manufacturing systems using the concept of multifidelity. The concept of multifidelity has been proposed by several researchers in order to reduce the computation time for simulation. In this paper, a GA-based heuristic procedure will be developed along with the multifidelity approach to solve a typical manufacturing scheduling problem. Four different fidelity models have been defined on which experimentation is carried out. The proposed method has been tested on a sample dataset and the results have been analysed to choose the fidelity model which best describes the scenario.
Original language | English |
---|---|
Pages (from-to) | 526-534 |
Number of pages | 9 |
Journal | Robotics and Computer-Integrated Manufacturing |
Volume | 26 |
Issue number | 5 |
DOIs | |
Publication status | Published - 1 Jan 2010 |
Keywords
- Automated manufacturing
- Flexibility
- Genetic algorithm
- Multifidelity
- Operation allocation
ASJC Scopus subject areas
- Control and Systems Engineering
- Software
- General Mathematics
- Computer Science Applications
- Industrial and Manufacturing Engineering