In the classical scheduling theory it is widely assumed that any task requires for its processing only one processor at a time. Nowadays with the technological progress this assumption has become not so obvious. In the paper, two algorithms for solving the problem of scheduling tasks requiring more than one processor at a time in the real-time environment, will be given. The first is based on a generation of all feasible layouts of tasks and on an application of linear programming. The second — heuristic one — is based on the descent search in solution space and the tabu search metaheuristic combined with linear programming. Results of a computational comparison of the two methods, are also reported.