Computers & Industrial Engineering, Journal Year: 2024, Volume and Issue: 196, P. 110488 - 110488
Published: Aug. 22, 2024
Language: Английский
Computers & Industrial Engineering, Journal Year: 2024, Volume and Issue: 196, P. 110488 - 110488
Published: Aug. 22, 2024
Language: Английский
Journal of Construction Engineering and Management, Journal Year: 2025, Volume and Issue: 151(4)
Published: Jan. 22, 2025
Language: Английский
Citations
1Computer Networks, Journal Year: 2025, Volume and Issue: unknown, P. 111156 - 111156
Published: Feb. 1, 2025
Language: Английский
Citations
0Computers & Industrial Engineering, Journal Year: 2025, Volume and Issue: unknown, P. 111108 - 111108
Published: April 1, 2025
Language: Английский
Citations
0Journal of Manufacturing Systems, Journal Year: 2025, Volume and Issue: 80, P. 794 - 823
Published: April 24, 2025
Language: Английский
Citations
0Measurement, Journal Year: 2024, Volume and Issue: unknown, P. 116075 - 116075
Published: Oct. 1, 2024
Language: Английский
Citations
3Engineering Applications of Artificial Intelligence, Journal Year: 2024, Volume and Issue: 140, P. 109688 - 109688
Published: Nov. 27, 2024
Language: Английский
Citations
2Published: Jan. 1, 2024
This research delves into a scheduling challenge inherent in the wheel hub casting process, critical stage automotive manufacturing. The process involves shaping molten metal specific designs using dedicated molds. Diverse customer demands necessitate unique mold for each design, posing due to limited availability of these expensive and long-lasting There are 2 machines available casting. Each design requires mold. These molds expensive, long-lasting, need periodic maintenance. objective function is minimize total time (makespan) complete all jobs. Only one job requiring can be processed at (due limitations). Molds unavailable during maintenance periods. lies jobs considering both machine constraints overall production time. We formulate mathematical model mixed integer programming precisely represent problem its constraints. Inspired by Longest Processing Time (LPT) rule, we propose heuristic named LRTPT efficiently schedule on two machines. For large-scale problems, employ novel SIAIS algorithm find near-optimal solutions effectively. also present branch bound specifically tailored solve smaller-sized instances problem. leverages lower bounds several dominance properties expedite search optimal solution. To evaluate effectiveness our proposed approaches, conduct series comprehensive experiments. results demonstrate that significantly outperforms widely used optimization solver CPLEX smaller problems. Furthermore, proves more efficient than existing heuristics.
Language: Английский
Citations
0Computers & Industrial Engineering, Journal Year: 2024, Volume and Issue: 196, P. 110488 - 110488
Published: Aug. 22, 2024
Language: Английский
Citations
0