Scheduling tasks on a flexible manufacturing machine to minimize tool change delays |
| |
| Affiliation: | 1. Department of Business Administration, Kettering University, Flint, MI, USA;2. Department of Mathematics and Computer Science, University of Douala, Douala, Cameroon;3. Department of Economy and Public Policy, University of Douala, Douala, Cameroon;1. Business Administration Program, Middle East Technical University, Northern Cyprus Campus, Kalkanli 99738, Mersin 10, Turkey;2. Department of Industrial Engineering, Middle East Technical University, Ankara 06800, Turkey;1. School of Management, Jilin University, Changchun, China;2. College of Business, University of Alabama in Huntsville, Huntsville, AL 35899, USA;3. China State Shipbuilding Corporation, System Engineering Research Institute, Beijing, China;4. Faculty of Mathematics, Otto-von-Guericke University, Magdeburg, Germany |
| |
| Abstract: | This paper considers the problem of scheduling a given set of precedence constraint tasks on a flexible machine equipped with a tool magazine where each task requires exactly one of the tools during its execution. Changing from one tool to another requires a certain amount of time that depends on the pair of tools being exchanged. We present a new algorithmic approach for general task precedence relations when it is desired to sequence the tasks in such a way that the total time required for tool changes is minimized. The proposed algorithm is of polynomial time complexity in case of task precedences of limited width w, i.e. for precedence relations where each subset of independent tasks has not more than w elements. Since the task precedences width w could be arbitrary, we describe two heuristic algorithms and empirically evaluate their effectiveness in finding schedules with minimum total time required for tool changes. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
