Scheduling Problem with Uncertain Parameters in Just in Time System

摘要

This paper tackles a stochastic version of single machine scheduling with random processing times and due dates. The objective function is to find a schedule of jobs which minimizes the weighted sum of earliness and tardiness penalties, taking into consideration probabilistic modelling of the tasks processing times. Since the problem is NP-hard, it is not possible to find optimal values for large scales of the problem in a reasonable run time, therefore, a tabu search meta-heuristic is provided. Computational experiments demonstrate that the proposed tabu search algorithm is strongly capable of finding near optimal stability solutions with a very low gap.