Team : RO
Invited by : Evripidis BAMPIS
Arrival date : 07/03/2017
Departure date : 07/20/2017
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.
Talks : Séminaire du 13 jullet 2017 - A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job