KONONOV Alexander

科研组 : RO
被。。。邀请 : Evripidis BAMPIS
到达日期 : 2017-7-3
离开日期 : 2017-7-20


In a so-called mixed-shop scheduling problem, the operations of some jobs have to be processed in a fixed order (as in the job-shop problem); the other ones can be processed in an arbitrary order (as in the open-shop problem). In this paper we present a new exact polynomial-time algorithm for the mixed-shop problems with preemptions and at most two unit operations per job.
Joint work with Aldar Dugarzhapov.

报告 : Séminaire du 13 jullet 2017 - A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job

 Mentions légales
网站导航 |