On preemptive scheduling on unrelated machines using linear programming

On preemptive scheduling on unrelated machines using linear programming

We consider a basic preemptive scheduling problem where $ n $ non-simultaneously released jobs are to be processed by $ m $ unrelated parallel machines so as to minimize maximum job completion time. An optimal LP-solution has been used to construct an optimal preemptive schedule for simultaneously r...

Full description

Bibliographic Details
Main Author: Nodari Vakhania
Format: Article
Language:English
Published: AIMS Press 2023-01-01
Series:AIMS Mathematics
Subjects:
scheduling
unrelated machines
release time
linear programming
time complexity
Online Access:https://www.aimspress.com/article/doi/10.3934/math.2023356?viewType=HTML

Internet

https://www.aimspress.com/article/doi/10.3934/math.2023356?viewType=HTML

Similar Items