On Scheduling Independent Tasks with Restricted Execution Times

Joseph Y.-T. Leung
Additional contact information
Joseph Y.-T. Leung: Northwestern University, Evanston, Illinois

Operations Research, 1982, vol. 30, issue 1, 163-171

Abstract: We consider the problem of nonpreemptively scheduling n independent tasks on m identical and parallel machines with the objective of minimizing the overall finishing time. The problem has been shown to be NP-complete in the strong sense and hence there probably will not be any pseudopolynomial time algorithm for solving this problem. We show, however, that if the execution times are restricted to a fixed number, say k , of different values, then it can be solved in polynomial time. Our algorithm can be implemented to run in time 0(log 2 p * log 2 m * n 2( k −1) ) and space 0(log 2 m * n k −1 ) in the worst case, where p is the largest execution time.

Keywords: 111 dynamic programming method; 584 deterministic scheduling theory (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.30.1.163 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:30:y:1982:i:1:p:163-171

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().