Efficient approximation algorithms for scheduling problems with uniform p-batch machines and arbitrary processing set restrictions

Bibliographic Details
Title:	Efficient approximation algorithms for scheduling problems with uniform p-batch machines and arbitrary processing set restrictions
Authors:	Sevastyanov, Sergey^{Aff1, IDs10951025008678_cor1}
Source:	Journal of Scheduling. 29(3):203-228
Database:	Springer Nature Journals

Be the first to leave a comment!