Complexity results for scheduling tasks with discrete starting times
Suppose that n independent tasks are to be scheduled without preemption on a set of identical parallel processors. Each task t/sub i/ requires a given execution time tau/sub i/ and it may be started for execution on any processor at any of its prescribed starting times. The problem of finding a feasible schedule on a single processor is np-complete in the strong sense. The same problem is, however, shown to be solvable in o(n log n) time, under certain conditions. The problem of finding a feasible schedule on an arbitrary number of processors is strongly np-complete. Finally a special case of the above multiprocessor scheduling problem is shown to be solvable in polynomial time. 15 references.
- Research Organization:
- Texas Technical Univ., Lubbock
- OSTI ID:
- 6282438
- Journal Information:
- J. Algorit.; (United States), Journal Name: J. Algorit.; (United States) Vol. 4; ISSN JOALD
- Country of Publication:
- United States
- Language:
- English
Similar Records
Scheduling multiprocessor tasks to minimize schedule length
Multiprocessor on-line scheduling of hard-real-time tasks