A note on labeling methods to schedule unit execution time tasks in the presence of delayed precedence constraints

Mallach, Sven (2021) A note on labeling methods to schedule unit execution time tasks in the presence of delayed precedence constraints.
Published in: Journal of Parallel and Distributed Computing Vol. 156. pp. 1-6.


Actions:
Full text not available from this repository.
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Article
Citations: No citation data.
Uncontrolled Keywords:
Subjects:
  • 68-XX Computer science > 68Mxx Computer system organization > 68M07 Mathematical problems of computer architecture

  • 68-XX Computer science > 68Mxx Computer system organization > 68M20 Performance evaluation; queueing; scheduling

  • 68-XX Computer science > 68Nxx Software > 68N20 Compilers and interpreters

  • 68-XX Computer science > 68Wxx Algorithms > 68W25 Approximation algorithms

  • 68-XX Computer science > 68Wxx Algorithms > 68W40 Analysis of algorithms

  • 90-XX Operations research, mathematical programming > 90Bxx Operations research and management science > 90B35 Scheduling theory, deterministic

  • 90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C27 Combinatorial optimization

    		•
    Divisions: UNSPECIFIED
    Related URLs:
    Deposit Information:
    ZAIK Number: UNSPECIFIED
    Depositing User: Sven Mallach
    Date Deposited: 26 May 2021 12:25
    Last Modified: 08 Nov 2021 11:30
    URI: http://e-archive.informatik.uni-koeln.de/id/eprint/952