This brief, but interesting, paper considers the problem of minimizing schedule length in systems in which some tasks must be processed in parallel, by two arbitrary processors, while other single-processor tasks are scheduled. Optimization of scheduling involves allocation of processors to two-processor tasks first, followed by scheduling of single-processor tasks. The obvious weakness in this paper is that the scheduling algorithm only addresses homogenous processors and that only one and two-processor tasks are considered. The authors are working on a paper, to be published later, dealing with these problems. This later paper would be of interest to those working in the multimicroprocessor environment.