A new bounding mechanism for the CNC machine scheduling problems with controllable processing times |
| |
| Affiliation: | 1. IK4–TEKNIKER, Polo Tecnológico de Eibar, Calle Iñaki Goenaga 5, 20600 Eibar, Spain;2. Departamento de Ingeniería Mecánica, Escuela Técnica Superior de Ingeniería, Universidad del País Vasco UPV/EHU, Alameda de Urquijo s/n, 48013 Bilbao, Spain;1. School of Transportation Science and Engineering, Beijing Key Laboratory for Cooperative Vehicle Infrastructure Systems and Safety Control, Beihang University, Beijing 100191, China;2. School of Transportation and Logistics, Dalian University of Technology, Dalian 116024, China;1. Department of IT,Rajagiri School of Engineering and Technology, Kerala,682 039 India;2. Department Of CSE,National Institute of Technology,Surathkal,Karnataka,575025 India;1. Department of Business Administration, Chungnam National University, 79 Daehangno, Yuseong-gu, Daejeon 305-704, Republic of Korea;2. Department of Business Administration, Daejeon University, 96-3 Yongun-dong, Dong-gu, Daejeon 300-716, Republic of Korea |
| |
| Abstract: | In this study, we determine the upper and lower bounds for the processing time of each job under controllable machining conditions. The proposed bounding scheme is used to find a set of discrete efficient points on the efficient frontier for a bi-criteria scheduling problem on a single CNC machine. We have two objectives; minimizing the manufacturing cost (comprised of machining and tooling costs) and minimizing makespan. The technological restrictions of the CNC machine along with the job specific parameters affect the machining conditions; such as cutting speed and feed rate, which in turn specify the processing times and tool lives. Since it is well known that scheduling problems are extremely sensitive to processing time data, system resources can be utilized much more efficiently by selecting processing times appropriately. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
