20 research outputs found
Precedence-constrained scheduling problems parameterized by partial order width
Negatively answering a question posed by Mnich and Wiese (Math. Program.
154(1-2):533-562), we show that P2|prec,|, the
problem of finding a non-preemptive minimum-makespan schedule for
precedence-constrained jobs of lengths 1 and 2 on two parallel identical
machines, is W[2]-hard parameterized by the width of the partial order giving
the precedence constraints. To this end, we show that Shuffle Product, the
problem of deciding whether a given word can be obtained by interleaving the
letters of other given words, is W[2]-hard parameterized by , thus
additionally answering a question posed by Rizzi and Vialette (CSR 2013).
Finally, refining a geometric algorithm due to Servakh (Diskretn. Anal. Issled.
Oper. 7(1):75-82), we show that the more general Resource-Constrained Project
Scheduling problem is fixed-parameter tractable parameterized by the partial
order width combined with the maximum allowed difference between the earliest
possible and factual starting time of a job.Comment: 14 pages plus appendi
Recommended from our members
When Stars Displace the Gods: The Folk Culture of Cinema in Tamil Nadu
Governmen
Recommended from our members
The Dravidian Movement
Table of Contents -- I. Introduction: The Transformation of Primordial Sentiment p. 1 / II. Foundation of the Dravidian Movement p. 8 / III. The Justice Party p. 16 / IV. The Dravida Kazagham p. 25 / V. The Dravida Munnetra Kazagham p. 32 / VI. Dravidian Politics and the First General Elections p. 40 / VII. The Second General Elections p. 51 / VIII. Crisis and Victory p. 65 / Bibliography p. 81 / Index p. 87Governmen