Wu, C.-H.C.-H.WuOng, S.-T.S.-T.OngCHENG-HUNG WU2021-02-042021-02-042019https://www.scopus.com/inward/record.url?eid=2-s2.0-85079218367&partnerID=40&md5=3e95c509e09c2b5df203e080ce3d9352https://scholars.lib.ntu.edu.tw/handle/123456789/546921This paper studies the scheduling problem of turning process in the identical parallel machine environment. Scheduling of turning machine is a case of controllable processing time scheduling since the processing time of turning operation can be adjusted by altering the cutting speed, feed rate and depth of cut. The determination of subdivision of depth of cut is another decision problem to be solved in turning operation. Since the determination of subdivision of depth of cut is a MINLP problem itself, the combination of the two problems makes the scheduling problem of turning machine very hard to solve. Our research objective is to build an effective approach to solve the minimization of the manufacturing cost and weighted tardiness cost in the scheduling of parallel turning machine with multi-pass turning. The robustness of the methodology and computationally efficient are demonstrated under different scenario settings. © 2019 IEEE.Cutting Parameters; Energy Consumption; Parallel Machines; scheduling[SDGs]SDG7[SDGs]SDG9Cutting; Energy utilization; Flow control; Industrial research; Scheduling; Turning; Computationally efficient; Controllable processing time; Cutting parameters; Cutting parameters optimizations; Effective approaches; Identical parallel machines; Parallel machine; Research objectives; Cutting toolsconference paper10.1109/SMILE45626.2019.89652932-s2.0-85079218367