This thesis aims to give to firms a tool that supports short-term decisions about the processing order of different jobs on a single machine. In particular, a lot of companies often face scheduling problems where the goal is to minimize the number of overdue jobs or, simply, delays. The importance to find a good solution has impact not only for customer loyalty but, most of all, in terms of production costs: usually delays, due to contractual constraints, involve the payment of penalties related to the number of late jobs or related to the overall amount of delay. In these situations, if the order scheduling is not computed by a robust tool, decisions follow, in most cases, the importance of jobs or the importance of the customer without having an overall view of the different effects that the entire schedule entails.