Thông tin chung
  English
  Đề tài NC khoa học
  Bài báo, báo cáo khoa học
  Hướng dẫn Sau đại học
  Sách và giáo trình
  Các học phần và môn giảng dạy
  Giải thưởng khoa học, Phát minh, sáng chế
  Khen thưởng
  Thông tin khác
  Tài liệu tham khảo
  Hiệu chỉnh
 
Số người truy cập: 107,384,921

 Tích hợp khuôn khổ đưa ra quyết định để định tuyến bảo trì và lập lịch bảo trì
Tác giả hoặc Nhóm tác giả: Ho Si Hung Nguyen; Thi Hoang Giang Tran
Nơi đăng: 2nd Annual International Conference on Material, Machines and Methods for Sustainable Development; Số: 2;Từ->đến trang: 111-118;Năm: 2020
Lĩnh vực: Khoa học công nghệ; Loại: Báo cáo; Thể loại: Quốc tế
TÓM TẮT
ABSTRACT
In recent, a new production model, named geographically dispersed production system (GDPS), has emerged. The GDPS is a geographically dispersed production network in which the production is done over a number of sites located far apart from each other. The GDPS is subjected to management of an administration center. In fact, to establish maintenance plan for a GDPS, planners use the grouping maintenance strategy to save preparation cost and transportation cost. When grouping maintenance activities of components located at different sites, maintenance resources can travel from the maintenance center to the maintenance sites where these components are located on, and then come back to the maintenance center when the maintenance is completed. By that way, travel distance as well as emissions from means of transports can reduce compared to individual maintenance. In addition, maintenance planning for geographically dispersed production systems closely depend on the degradation of components, the availability of spare parts and maintenance team. This open issue motivates our works developed a maintenance model with joint decision-making on the maintenance scheduling and routing. First, the interactions between the maintenance scheduling and routing are analysed and formulated. Then an evolutionary algorithm based on Genetic Algorithm (GA) and Branch and Bound algorithm (BAB) is developed to solve the joint decision-making problem. The uses and advantages of the proposed joint optimization approach are illustrated through a numerical example of a GDPS consisting of fifteen components located in five different sites.
© Đại học Đà Nẵng
 
 
Địa chỉ: 41 Lê Duẩn Thành phố Đà Nẵng
Điện thoại: (84) 0236 3822 041 ; Email: dhdn@ac.udn.vn