Complexity results for scheduling tasks in fixed intervals on two types of machines
Journal Article
·
· SIAM J. Comput.; (United States)
Suppose that n independent tasks are to be scheduled without preemption on an unlimited number of parallel machines of two types: inexpensive slow machines and expensive fast machines. Each task requires a given processing time on a slow machine or a given smaller processing time on a fast machine. The authors make two different feasibility assumptions: (a) each task has a specified processing interval, the length of which is equal to the processing time on a slow machine; (b) each task has a specified starting time. For either problem type, they wish to find a feasible schedule of minimum total machine cost. It is shown that both problems are np-hard in the strong sense. These results are complemented by polynomial algorithms for some special cases. 17 references.
- Research Organization:
- Texas Technology Univ., Lubbock
- OSTI ID:
- 5000959
- Journal Information:
- SIAM J. Comput.; (United States), Journal Name: SIAM J. Comput.; (United States) Vol. 3; ISSN SMJCA
- Country of Publication:
- United States
- Language:
- English
Similar Records
Complexity results for scheduling tasks with discrete starting times
Scheduling with stochastic gert precedence constraints
Scheduling multiprocessor tasks to minimize schedule length
Journal Article
·
Tue Nov 30 23:00:00 EST 1982
· J. Algorit.; (United States)
·
OSTI ID:6282438
Scheduling with stochastic gert precedence constraints
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36340
Scheduling multiprocessor tasks to minimize schedule length
Journal Article
·
Thu May 01 00:00:00 EDT 1986
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5791128