Budget Minimization with Precedence Constraints

05/31/2019
by   Marinus Gottschau, et al.
0

Budget Minimization is a scheduling problem with precedence constraints, i.e., a scheduling problem on a partially ordered set of jobs (N, ). A job j ∈ N is available for scheduling, if all jobs i ∈ N with i j are completed. Further, each job j ∈ N is assigned real valued costs c_j, which can be negative or positive. A schedule is an ordering j_1, ..., j_ N of all jobs in N. The budget of a schedule is the external investment needed to complete all jobs, i.e., it is _l ∈{0, ..., N }∑_1 < k < l c_j_k. The goal is to find a schedule with minimum budget. Rafiey et al. (2015) showed that Budget Minimization is NP-hard following from a reduction from a molecular folding problem. We extend this result and prove that it is NP-hard to α(N)-approximate the minimum budget even on bipartite partial orders. We present structural insights that lead to arguably simpler algorithms and extensions of the results by Rafiey et al. (2015). In particular, we show that there always exists an optimal solution that partitions the set of jobs and schedules each subset independently of the other jobs. We use this structural insight to derive polynomial-time algorithms that solve the problem to optimality on series-parallel and convex bipartite partial orders.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/04/2022

On Preemptive Scheduling of Unrelated Machines Using Linear Programming

We consider a basic problem of preemptive scheduling of n non-simultaneo...
research
03/04/2019

Workflow Scheduling in the Cloud with Weighted Upward-rank Priority Scheme Using Random Walk and Uniform Spare Budget Splitting

We study a difficult problem of how to schedule complex workflows with p...
research
10/17/2018

An EPTAS for machine scheduling with bag-constraints

Machine scheduling is a fundamental optimization problem in computer sci...
research
10/25/2020

Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines

In this paper we consider the problem of scheduling on parallel machines...
research
10/23/2019

Maintenance scheduling in a railway corricdor

We investigate a novel scheduling problem which is motivated by an appli...
research
12/14/2022

Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput

Motivated by baterryless IoT devices, we consider the following scheduli...
research
07/18/2019

Makespan Minimization with OR-Precedence Constraints

We consider a variant of the NP-hard problem of assigning jobs to machin...

Please sign up or login with your details

Forgot password? Click here to reset