Two meta-heuristic algorithms for scheduling on unrelated machines with the late work criterion

Authors:

Abstract
A scheduling problem in considered on unrelated machines with the goal of total late work minimization, in which the late work of a job means the late units...

This publication has 33 references indexed in Scilit: