On the Complexity of a Periodic Scheduling Problem with Precedence Relations
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F20%3A00344230" target="_blank" >RIV/68407700:21730/20:00344230 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/978-3-030-64843-5_8" target="_blank" >https://doi.org/10.1007/978-3-030-64843-5_8</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-64843-5_8" target="_blank" >10.1007/978-3-030-64843-5_8</a>
Alternative languages
Result language
angličtina
Original language name
On the Complexity of a Periodic Scheduling Problem with Precedence Relations
Original language description
Periodic scheduling problems (PSP) are frequently found in a wide range of applications. In these problems, we schedule a set of tasks on a set of machines in time, where each task is to be executed repeatedly with a given period. The tasks are assigned to machines, and at any moment, at most one task can be processed by a given machine. Since no existing works address the complexity of PSPs with precedence relations, we consider the most basic PSP with chains and end-to-end latency constraints given in the number of periods. We define a degeneracy of a chain as the number of broken precedence relations within the time window of one period. We address the general problem of finding a schedule with the minimum total degeneracy of all chains. We prove that this PSP is strongly NP-hard even when restricted to unit processing times, a common period, and 16 machines, by a reduction from the job shop scheduling problem. Finally, we propose a local search heuristic to solve the general PSP and present its experimental evaluation.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
R - Projekt Ramcoveho programu EK
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Lecture Notes in Computer Science
ISBN
978-3-030-64842-8
ISSN
0302-9743
e-ISSN
1611-3349
Number of pages
18
Pages from-to
107-124
Publisher name
Springer
Place of publication
Cham
Event location
Dallas, Texas
Event date
Dec 11, 2020
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—