Prelegent: Prof. dr hab. Stanisław Gawiejnowicz (Pracownia Algorytmiki)
Data i godzina: 05 listopada 2024 r., g. 11:00
Streszczenie: We propose two new fully polynomial-time approximation schemes for maximizing the weighted number of just-in-time jobs in a multi-machine proportionate flow shop system, applying recently proposed frameworks for the construction of approximation schemes for monotone dynamic programming formulations. The proposed schemes are faster by a linear factor with respect to the number of jobs than the state-of-the-art scheme for the problem.