Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 Foundations of Computing and Decision Sciences

1 2010

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Earliness-Tardiness Cost

Sortuj według:

Ogranicz wyniki do:

Job-Dependent Due-Window Assignment Based On A Common Flow Allowance

Mosheiov G., Oron D.

Foundations of Computing and Decision Sciences

2010

Vol. 35, No. 3

185-195

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.