• DocumentCode
    3663604
  • Title

    Task scheduling with restricted preemptions on two parallel processors

  • Author

    Krzysztof Pieńkosz;Adam Prus

  • Author_Institution
    Institute of Control and Computation Engineering, Warsaw University of Technology, Warsaw, Poland
  • fYear
    2015
  • Firstpage
    58
  • Lastpage
    61
  • Abstract
    In the paper a task scheduling problem on two parallel identical processors is considered. The objective is to find the schedule of minimum makespan. We assume that tasks are independent and can be preempted but preemption is only allowed if a task is continuously processed for at least k units of time. We propose two heuristic scheduling algorithms for such a problem and compare their effectiveness with other algorithms known from the literature.
  • Keywords
    "Program processors","Schedules","Processor scheduling","Optimal scheduling","Heuristic algorithms","Job shop scheduling"
  • Publisher
    ieee
  • Conference_Titel
    Methods and Models in Automation and Robotics (MMAR), 2015 20th International Conference on
  • Type

    conf

  • DOI
    10.1109/MMAR.2015.7283706
  • Filename
    7283706
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3663604