Two Meta–Heuristic Algorithms for Scheduling on Unrelated Machines with the Late Work Criterion
Sign Up to like & getrecommendations! Published in 2020 at "International Journal of Applied Mathematics and Computer Science"
DOI: 10.34768/amcs-2020-0042
Abstract: 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 executed after its due date. Due… read more here.
Keywords: work; unrelated machines; two meta; heuristic algorithms ... See more keywords