Login

Wykład otwarty profesora Hansa Kellerera

Pracownia Algorytmiki serdecznie zaprasza na wykład pt. Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times under Non-Availability or Deadline Constraints, który wygłosi prof. Hans Kellerer (University of Graz, Austria). Wykład odbędzie się we wtorek, 14 stycznia 2020 r., o godz. 13:30 w sali posiedzeń Rady Wydziału (A1-33/34). Przed wykładem, o godz. 13:00, odbędzie się spotkanie z Prelegentem w Klubie Profesorskim.

Abstract: We consider four single-machine scheduling problems with release times, with the aim of minimizing the maximum lateness. In the first problem we have a common deadline for all the jobs. The second problem looks for the Pareto frontier with respect to the two objective functions maximum lateness and makespan.The third problem is associated with a non-availability constraint. In the fourth one, the non-availability interval is related to the operator who is organizing the execution of jobs on the machine. For each of the four problems, we establish the existence of a polynomial time approximation scheme (PTAS).

Kalendarz wydarzeń

Pn Wt Śr Cz Pt So N
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30