The Tactical Fixed Interval Scheduling Problem (TFISP) is the problem of determining the minimum number of parallel nonidentical machines, such that a feasible schedule exists for a given set of jobs.

This article considers a new approximation to the log-likelihood surface in mixture models. This approximation is based on both the mean and variance of the full-data log-likelihood over imputations ...