21, 1–17 (2019)įu, Y., Li, H., Huang, M., Xiao, H.: Bi-objective modeling and optimization for stochastic two-stage open shop scheduling problems in the sharing economy. 153, 107077 (2021)Ĭankaya, B., Wari, E., Tokgoz, B.: Practical approaches to chemical tanker scheduling in ports: a case study on the Port of Houston. 142, 105744 (2022)Īghighi, S., Niaki, S., Mehdizadeh, E., Najafi, A.: Open-shop production scheduling with reverse flows. 54, 1–20 (2021)Ībreu, L., Prata, B., Framinan, J., Nagano, M.: New efficient heuristics for scheduling open shops with makespan minimization. 186, 115777 (2021)Ībreu, L., Araújo, K., Prata, B., Nagano, M., Moccellin, J.: A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions. KeywordsĪbdelmaguid, T.: Bi-objective dynamic multiprocessor open shop scheduling for maintenance and healthcare diagnostics. The extensive computational experience of five tested methods shows that the adapted heuristics are promising for solving large-sized instances and the CP model got the best average relative deviation with a value less than 8%. Since the problem under study is NP-hard, we test three classic heuristics of open shop adapted to the new variant to obtain high-quality solutions in acceptable computational times. The proposed CP model has not been addressed in the revised literature and outperforms all other exact methods in quality and efficiency. The objective function is the makespan minimization, and we use the relative deviation and computational times as performance criteria.
A integer linear programming and a constraint programming (CP) models are proposed. This paper aims to study the open shop scheduling problem with sequence-dependent processing times. Researchers have been paying particular attention to scheduling problems with processing times constraints in recent years, aiming to adopt more realistic assumptions.
0 kommentar(er)
