A heuristic algorithm for minimizing maintenance workforce level
SCIE
SCOPUS
- Title
- A heuristic algorithm for minimizing maintenance workforce level
- Authors
- Chang, SY; Hong, Y; Kim, JH; Kim, X
- Date Issued
- 1999-12
- Publisher
- TAYLOR & FRANCIS LTD
- Abstract
- We develop a heuristic algorithm for minimizing the workforce level required to accommodate all the maintenance jobs requested within a specific time interval. Each maintenance job has its own release and due dates as well as the required man-days, and must be scheduled in a noninterrupted time interval, i.e. without preemption. However, the duration of each job is not fixed, but to be determined within a specific range. We show that this problem can be seen as a variant of the two-dimensional bin-packing problem with some additional constraints. We develop a non-linear mixed integer programming model for the proposed problem, and employ some well-known bin-packing algorithms to develop an efficient heuristic algorithm. In order to evaluate the performance of the proposed heuristic, we present a computationally efficient scheme for getting a good lower hound for the actual minimum. The computational experiment shows that the proposed heuristic algorithm performs quite satisfactorily in practice.
- Keywords
- maintenance; scheduling; workforce level; bin-packing
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/28834
- DOI
- 10.1080/095372899232605
- ISSN
- 0953-7287
- Article Type
- Article
- Citation
- PRODUCTION PLANNING & CONTROL, vol. 10, no. 8, page. 778 - 786, 1999-12
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.