A cardinality-constrained approach for robust machine loading problems

The Machine Loading Problem (MLP) refers to the allocation of operative tasks and tools to machines for the production of parts. Since the uncertainty of processing times might affect the quality of the solution, this paper proposes a robust formulation of an MLP, based on the cardinality-constrained approach, to evaluate the optimal solution in the presence of a given number of fluctuations of the actual processing time with respect to the nominal one. The applicability of the model in the practice has been tested on a case study.