Min–max regret-based robust makespan minimization of the unrelated parallel batch processing machine scheduling problem with uncertain processing time.
Saved in:
| Title: | Min–max regret-based robust makespan minimization of the unrelated parallel batch processing machine scheduling problem with uncertain processing time. |
|---|---|
| Authors: | Ji, Bin1, chcujibin@csu.edu.cn, Xiao, Xin1, Yu, Samson S.2, Zhang, Dezhi1 |
| Source: | Engineering Optimization; Jun2026, Vol. 58 Issue 6, p1631-1651, 21p |
| Database: | Applied Science & Technology Source |
| ISSN: | 0305215X |
|---|---|
| DOI: | 10.1080/0305215X.2025.2527731 |
