Article ID Journal Published Year Pages File Type
10524050 Operations Research Letters 2005 8 Pages PDF
Abstract
In this paper, we consider the preemptive scheduling problem on a fixed number of identical parallel machines. We present a polynomial-time algorithm for finding a minimal length schedule for an order class which contains properly interval orders.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Optimal preemptive scheduling on a fixed number of identical parallel machines
Authors
, ,