Many multiple criteria scheduling problems reach a complexity level that can be difficult, if not impossible, to capture in a mathematical model. Most of these problems are classified as NP-hard. Woolsey [21] points out that "scheduling is almost never an activity in which there is just one goal". For this reason scheduling was chosen for the example but in reality Taguchi Loss Functions could be used to develop a single objective function for almost any function in a Multi-Criteria Context. For example, if one heuristic measure, such as minimizing tardiness, is used to determine a heuristic's utility, a scheduling policy may be implemented that results in a significant number of early jobs. This policy may not be appropriate if the organization is also interested in limiting the amount of completed inventory on hand. In this paper we suggest that one possible solution to the multiple criteria scheduling problem is using Taguchi loss functions as an objective function for the scheduling algorithm or heuristic.