Since there is no restriction as to the order of the performers, I think that the answer to this problem is just the factorial of 8. So 8! is equal to (8)(7)(6)(5)(4)(3)(2)(1) which in turn is equal to 40,320 times. There are 40,320 different ways to schedule the appearances of the eight performers.
