Elsevier

Information Processing Letters

Volume 48, Issue 6, 20 December 1993, Pages 315-320
Information Processing Letters

Complexity of scheduling tasks with time-dependent execution times

https://doi.org/10.1016/0020-0190(93)90175-9Get rights and content

Abstract

A new model of task system in which the execution time of a task depends on its starting time is considered. It is shown that the feasibility problem on a single processor is NP-complete for a set of tasks with identical release times and two distinct deadlines. An O(n log n)-time algorithm is given for a set of tasks with identical release times and deadlines. These two results give a sharp boundary delineating the complexity of the problem.

References (7)

  • J. Berger, Private...
  • J. Du et al.

    Complexity of scheduling parallel task systems

    SIAM J. Discrete Math.

    (1989)
  • M.R. Garey et al.

    Computers and Intractability: A Guide to the Theory of NP-Completeness

    (1979)
There are more references available in the full text version of this article.

Cited by (0)

Research supported in part by the ONR grant N00014-91-J-1383 and in part by a grant from Texas Instruments, Inc.

∗∗∗

On leave from Department of Mathematics, Sichuan University, Chengdu, 610064, China.

View full text