A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job
Speaker(s) : Alexander Kononov (Sobolev Institute of Mathematics)
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 prob- lem). 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.
Christoph.Durr (at) nullLIP6.fr