no code implementations • 20 Nov 2020 • Margaux Nattaf, Arnaud Malapert
This paper uses a polynomial-time algorithm which minimize the flow time for a single machine relaxation where disqualifications are not considered.
no code implementations • 16 Oct 2019 • Arnaud Malapert, Margaux Nattaf
In this problem, each job belongs to a family and a family can only be executed on a subset of qualified machines.