Datum / čas
Date(s) - 09.06.
15:00 - 16:30
Kategorie ne Kategorie
Updated complexity results in single-machine primary-secondary sched. for min. two regular criteria
by Jinjiang Yuan (Zhengzhou Univ.)
In the primary-secondary scheduling problem, we have a primary scheduling criterion and a secondary scheduling criterion. The goal of the problem is to find a schedule which minimizes the second criterion, subject to the restriction that the primary criterion is minimized. Lee and Vairaktarakis [LV1993] presented a comprehensive review for the computational complexity of the single-machine primary-secondary scheduling problems, where all the jobs are released at time zero. When both of the two criteria are regular, more than twenty problems were posed as open in [LV1993]. This talk will report the research progress of these open problems.
More information: https://schedulingseminar.com/
You can follow the seminar online or offline on our Youtube channel: