This shareable PDF can be hosted on any platform or network and is fully compliant with publisher copyright.
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.
Photo by Lenny Kuhne on Unsplash
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:
The following have contributed to this page
Journal of Applied Psychology
While overt racism is condemned by many organizations, Black employees still face a host of daily verbal, behavioral and environmental slights related to their physical appearance, work ethic, inte...
Journal of World Business
China’s socio-political institutions create state-owned corporate empires with unique agency conflicts when increased state ownership drives higher management expenses and lower firm profitability ...
Employee Relations
When organizations are in crisis, the experiences of the employees are often ignored. However, without employee support and engagement, organizations cannot manage crises effectively. The present s...
