Min–max regret-based robust makespan minimization of the unrelated parallel batch processing machine scheduling problem with uncertain processing time.

Saved in:
Bibliographic Details
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
Be the first to leave a comment!
You must be logged in first