162. Scheduling multiple flexible maintenance activities
Invited abstract in session TD-17: Optimizing Complex Systems: Advances in Combinatorial and Stochastic Techniques, stream Combinatorial Optimization.
Tuesday, 14:30-16:00Room: Esther Simpson 2.08
Authors (first author is the speaker)
| 1. | Eun-Seok Kim
|
| School of Business and Management, Queen Mary University of London | |
| 2. | Ik Sun Lee
|
| Business Administration, Dong-A University | |
| 3. | Sunghoon Lim
|
| UNIST |
Abstract
Maintenance scheduling is a major challenge that many industries, such as manufacturing, aviation, railway, and service industries, face today. Poorly planned maintenance can lead to shortened equipment life and decreased productivity. This article considers a single machine scheduling problem with multiple flexible maintenance activities and health index requirements of jobs. The single machine features a health index that decreases as it processes jobs, each with its own health index requirements. The objective is to minimise the total completion time of the jobs.
The considered problem is NP-hard in the strong sense. We study several special cases which are polynomially solvable and present a Mixed Integer Programming (MIP) formulation for the general case. Some valid inequalities are also developed to narrow down the search space for finding an optimal solution of the MIP. Furthermore, we examine optimal properties of the problem and develop a simple heuristic algorithm with its approximability. In extensive computational experiments, it is demonstrated that the proposed heuristic algorithm produces solutions that are highly effective and efficient.
Keywords
- Combinatorial Optimization
- Scheduling
Status: accepted
Back to the list of papers