1. Network flows: Theory, algorithm, and applications;Ahuja,1993
2. Scheduling preemptable tasks on parallel processors with limited availability;Blazewicz;Parallel Computing,2000
3. Scheduling multiprocessor tasks on parallel processors with limited availability;Blazewicz;European Journal of Operational Research,2003
4. Bruno, J., & Gonzalez, T. (1976). Scheduling independent tasks with release dates and due dates on parallel machines. Technical Report 213, Computer Science Department, Pennsylvania State University.
5. Minimizing makespan on parallel machines with release time and machine eligibility restrictions;Centeno;International Journal of Production Research,2004