ON SCHEDULING INDEPENDENT TASKS WITH RESTRICTED EXECUTION TIMES.

Joseph Leung

Research output: Contribution to journalArticle

29 Citations (Scopus)

Abstract

Consideration is given to 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 is shown to be NP-complete in the strong sense and there probably will not be any pseudopolynomial time algorithm for solving this problem. It is shown, 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. The author's algorithm can be implemented to run in time O(log//2p*log//2m*n**2**(**k** minus **1**) and space O(log//2m*n**k** minus **1**) in the worst case, where p is the largest execution time.

Original languageEnglish (US)
Pages (from-to)163-171
Number of pages9
JournalOperations Research
Volume30
Issue number1
DOIs
StatePublished - Jan 1 1982

Fingerprint

Scheduling
Polynomials

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Management Science and Operations Research

Cite this

Leung, Joseph. / ON SCHEDULING INDEPENDENT TASKS WITH RESTRICTED EXECUTION TIMES. In: Operations Research. 1982 ; Vol. 30, No. 1. pp. 163-171.
@article{1a56accf8a8e4749897d46df02348a0f,
title = "ON SCHEDULING INDEPENDENT TASKS WITH RESTRICTED EXECUTION TIMES.",
abstract = "Consideration is given to 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 is shown to be NP-complete in the strong sense and there probably will not be any pseudopolynomial time algorithm for solving this problem. It is shown, 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. The author's algorithm can be implemented to run in time O(log//2p*log//2m*n**2**(**k** minus **1**) and space O(log//2m*n**k** minus **1**) in the worst case, where p is the largest execution time.",
author = "Joseph Leung",
year = "1982",
month = "1",
day = "1",
doi = "https://doi.org/10.1287/opre.30.1.163",
language = "English (US)",
volume = "30",
pages = "163--171",
journal = "Operations Research",
issn = "0030-364X",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "1",

}

ON SCHEDULING INDEPENDENT TASKS WITH RESTRICTED EXECUTION TIMES. / Leung, Joseph.

In: Operations Research, Vol. 30, No. 1, 01.01.1982, p. 163-171.

Research output: Contribution to journalArticle

TY - JOUR

T1 - ON SCHEDULING INDEPENDENT TASKS WITH RESTRICTED EXECUTION TIMES.

AU - Leung, Joseph

PY - 1982/1/1

Y1 - 1982/1/1

N2 - Consideration is given to 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 is shown to be NP-complete in the strong sense and there probably will not be any pseudopolynomial time algorithm for solving this problem. It is shown, 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. The author's algorithm can be implemented to run in time O(log//2p*log//2m*n**2**(**k** minus **1**) and space O(log//2m*n**k** minus **1**) in the worst case, where p is the largest execution time.

AB - Consideration is given to 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 is shown to be NP-complete in the strong sense and there probably will not be any pseudopolynomial time algorithm for solving this problem. It is shown, 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. The author's algorithm can be implemented to run in time O(log//2p*log//2m*n**2**(**k** minus **1**) and space O(log//2m*n**k** minus **1**) in the worst case, where p is the largest execution time.

UR - http://www.scopus.com/inward/record.url?scp=0019912405&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0019912405&partnerID=8YFLogxK

U2 - https://doi.org/10.1287/opre.30.1.163

DO - https://doi.org/10.1287/opre.30.1.163

M3 - Article

VL - 30

SP - 163

EP - 171

JO - Operations Research

JF - Operations Research

SN - 0030-364X

IS - 1

ER -