What is it about?
This paper presents a lot of new complexity results for the problem of scheduling a set of jobs on parallel machines with a single server.
Featured Image
Photo by Lenny Kuhne on Unsplash
Read the Original
This page is a summary of: Complexity results for parallel machine problems with a single server, Journal of Scheduling, January 2002, Wiley,
DOI: 10.1002/jos.120.
You can read the full text:
Contributors
The following have contributed to this page
