A due-window assignment model is an extension of the classical due-date assignment, where a time interval (rather than a time point) is determined, such that jobs completed within this time interval are not penalized. Jobs completed outside the due-window are penalized according to their earliness/tardiness values. In this paper we solve a job-dependent due-window assignment problem, assuming a common flow allowance. We introduce an efficient 0(n log n) solution algorithm (where n is the number of jobs). We then consider the case of position-dependent processing times, showing that the problem remains solvable in polynomial time.
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ć.