Operation and preventive maintenance scheduling for containerships: Mathematical model and solution algorithm

Citations

WEB OF SCIENCE

19
Citations

SCOPUS

29

초록

This paper considers the problem of determining operation and maintenance schedules for a containership equipped with various subsystems during its sailing according to a pre-determined navigation schedule. The operation schedule, which specifies working time of each subsystem, determines the due-date of each maintenance activity and the maintenance schedule specifies the actual start time of each maintenance activity. The main constraints are subsystem requirements, workforce availability, working time limitation, and inter-maintenance time. To represent the problem mathematically, a mixed integer programming model is developed. Then, due to the complexity of the problem, we suggest a heuristic algorithm that minimizes the sum of earliness and tardiness between the due-date and the actual start time for each maintenance activity. Computational experiments were done on various test instances and the results are reported. In particular, a case study was done on a real instance and a significant amount of improvement is reported over the experience based conventional method. (c) 2013 Elsevier B.V. All rights reserved.

키워드

Containerships; Operation and maintenance scheduling; Integer programming; Heuristic; MULTI-COGENERATION PLANTS; THERMAL GENERATING-UNITS; POWER-SYSTEMS
제목
Operation and preventive maintenance scheduling for containerships: Mathematical model and solution algorithm
저자
Go, Hun; Kim, Ji-Su; Lee, Dong-Ho
DOI
10.1016/j.ejor.2013.04.005
발행일
2013-09
유형
Article
저널명
European Journal of Operational Research
권
229
호
3
페이지
626 ~ 636