Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: late work criterion

Sortuj według:

Ogranicz wyniki do:

Dominance relations for two-machine flow shop problem with late work criterion

Sterna M.

Bulletin of the Polish Academy of Sciences. Technical Sciences

2007

Vol. 55, nr 1

59-69

The paper concerns the two-machine non-preemptive flow shop scheduling problem with a total late work criterion and a common due date (F2/dj = d/ Y). The late work performance measure estimates the quality of a solution wit h regard to the duration of late parts of activities performed in the system, not taking into account the quantity of this delay. In the paper, a few theorems are formulated and proven, describing features of an optimal solution for the problem mentioned, which is NP-hard. These theorems can be used in exact exponential algorithms (as dominance relations reducing the number of solutions enumerated explicitly), as well as in heuristic and metaheuristic methods (supporting the construction of suboptimal schedules of a good quality).