A Fixed-Parameter Algorithm for Scheduling Unit Dependent Tasks on Parallel Machines with Time Windows - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2020

A Fixed-Parameter Algorithm for Scheduling Unit Dependent Tasks on Parallel Machines with Time Windows

Abstract

This paper proves that the existence of a feasible schedule for a set of dependent tasks of unit execution times with release dates and deadlines on a limited number of processors is a fixed-parameter tractable problem. The parameter considered is the pathwidth of the interval graph associated with the time windows of the tasks. A fixed-parameter algorithm based on a dynamic programming approach is developed and proved to solve this decision problem. Fixed-parameter algorithms for the two classical problems P |prec, p i = 1, r i |C max and P |prec, p i = 1, r i |L max are then derived using a binary search. They are, as far as we know, the first fixed-parameter algorithms for these scheduling problems.
Fichier principal
Vignette du fichier
DAM-VersionFinale.pdf (257.78 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03041735 , version 1 (05-12-2020)

Identifiers

  • HAL Id : hal-03041735 , version 1

Cite

Alix Munier Kordon. A Fixed-Parameter Algorithm for Scheduling Unit Dependent Tasks on Parallel Machines with Time Windows. Discrete Applied Mathematics, 2020. ⟨hal-03041735⟩
165 View
45 Download

Share

Gmail Facebook X LinkedIn More