May 3, 2016 · We show that the more general Resource-Constrained Project Scheduling problem is fixed-parameter tractable parameterized by the partial order width.

We show that the more general Resource-Constrained Project Scheduling problem is fixed-parameter tractable parameterized by the partial order width.

We study the parameterized complexity of the following NP-hard problem and various special cases [13, 15] with respect to the width of the given partial order.

Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width ; 1 SWT - TUB - Department of Software Engineering and Theoretical Computer ...

Precedence-constrained scheduling problems parameterized by partial order width · 1. each machine processes at most one job at a time, · 2. each job is processed ...

Problem 1.1 (P|prec|Cmax). Input: A number m of machines, a set J = {J1,...,Jn} of jobs, each job Jj with a processing time pj , and a partial order on J .

The following two problems are W[2]-hard parameterized by the width of the partial order giving the precedence constraints. (i) P2|prec,pj∈{1, 2}|Cmax,. (ii) ...

Precedence-constrained scheduling problems parameterized by partial order width. Publication Type: Conference Paper. Authors: René van Bevern; Robert ...

Dive into the research topics of 'Precedence-constrained scheduling problems parameterized by partial order width'. Together they form a unique fingerprint.

It is shown that the Precedence Constrained K-Processor Scheduling problem is hard for the parameterized complexity class W[2].