Vui lòng dùng định danh này để trích dẫn hoặc liên kết đến tài liệu này:
https://dspace.ctu.edu.vn/jspui/handle/123456789/91922Toàn bộ biểu ghi siêu dữ liệu
| Trường DC | Giá trị | Ngôn ngữ |
|---|---|---|
| dc.contributor.author | Ho, Vinh Thanh | - |
| dc.contributor.author | Phan, Nguyen Ky Phuc | - |
| dc.date.accessioned | 2023-09-28T07:06:34Z | - |
| dc.date.available | 2023-09-28T07:06:34Z | - |
| dc.date.issued | 2023 | - |
| dc.identifier.issn | 2615-9910 | - |
| dc.identifier.uri | https://dspace.ctu.edu.vn/jspui/handle/123456789/91922 | - |
| dc.description.abstract | In competitive global marketplace, production scheduling plays a vital role in manufacturing operations. The scheduling deal with the time to output the products and utilization of manufacturing resources. The case study was carried out in designing and 3D printing job shops of shell production for custom hearable device. In this research, we propose a mathematical mode! for two consecutive job shops of designing and 3D printing for maximizing makespan and utilizing the resources of designing stations and 3D printers. In order to solve this scheduling problem, it was defined, modelled as a mixed integer programming. And it was solved through the CP LEX solver. The test results demonstrate that the proposed mathematical model is optimal. | vi_VN |
| dc.language.iso | en | vi_VN |
| dc.relation.ispartofseries | Tạp chí Cơ khí Việt Nam;Số 302 .- Tr.272-278 | - |
| dc.subject | Scheduling | vi_VN |
| dc.subject | Job shop | vi_VN |
| dc.subject | Mixed integer programming | vi_VN |
| dc.subject | Makespan | vi_VN |
| dc.subject | Mathematical model | vi_VN |
| dc.title | Job shop scheduling for manufacturing process - case study: Designing and 3D printing processes of shell production for custom hearable device | vi_VN |
| dc.type | Article | vi_VN |
| Bộ sưu tập: | Cơ khí Việt Nam | |
Các tập tin trong tài liệu này:
| Tập tin | Mô tả | Kích thước | Định dạng | |
|---|---|---|---|---|
| _file_ Giới hạn truy cập | 2.79 MB | Adobe PDF | ||
| Your IP: 216.73.217.129 |
Khi sử dụng các tài liệu trong Thư viện số phải tuân thủ Luật bản quyền.