Makespan minimization for two parallel machines with an availability constraint |
| |
| Affiliation: | 1. Centre for Process Systems Engineering, Department of Chemical Engineering, University College London (UCL), Torrington Place, London WC1E 7JE, United Kingdom.;1. School of Computer Science, China University of Geosciences, Wuhan, China;2. State Key Lab of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, Wuhan, China;1. Department of Industrial Engineering, Istanbul Atlas University, Kagithane, Istanbul, Turkey;2. Department of Industrial and Systems Engineering, Ohio University, Athens, Ohio 45701, USA |
| |
| Abstract: | In this paper, we consider a two parallel machine problem where one machine is not available during a time period. The unavailable time period is fixed and known in advance. A machine is not available probably because it needs preventive maintenance or periodical repair. The objective of the problem is to minimize the makespan. For both nonresumable and resumable cases, we partition the problem into four sub-problems, each of which is solved optimally by an algorithm. Although all the algorithms have exponential time complexities, they are quite efficient in solving large-sized problems. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
