In this paper, we consider two single processor scheduling problems, in which a due interval should be assigned to each job. The due interval is a generalization of a due date and describes a time interval in which a job should be finished. Both problems considered have different mathematical models of the due intervals and the same criterion in which we minimize the weighted sum of the total earliness, the total tardiness and me due interval size. At first, we prove some properties of the optimal solution and we construct an optimal algorithm to solve the first problem. Next, we establish a property of symmetry, which helps us to solve the second problem based on the solution of the first one.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.