A $(2 + \epsilon)$-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
نویسندگان
چکیده
We give a (2 + ǫ)-approximation algorithm for minimizing total weighted completion time on a single machine under release time and precedence constraints. This settles a recent conjecture made in [18]
منابع مشابه
A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
We present a √ e/( √ e−1)-approximation algorithm for the nonpreemptive scheduling problem to minimize the total weighted completion time of jobs on a single machine subject to release dates and precedence constraints. The previously best known approximation algorithm dates back to 1997; its performance guarantee can be made arbitrarily close to the Euler constant e [18].
متن کاملScheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds
There has been recent success in using polyhedral formulations of scheduling problems not only to obtain good lower bounds in practice but also to develop provably good approximation algorithms. Most of these formulations rely on binary decision variables that are a kind of assignment variables. We present quite simple polynomial-time approximation algorithms that are based on linear programmin...
متن کاملA fuzzy mixed-integer goal programming model for a parallel machine scheduling problem with sequence-dependent setup times and release dates
This paper presents a new mixed-integer goal programming (MIGP) model for a parallel machine scheduling problem with sequence-dependent setup times and release dates. Two objectives are considered in the model to minimize the total weighted flow time and the total weighted tardiness simultaneously. Due to the com-plexity of the above model and uncertainty involved in real-world scheduling probl...
متن کاملTechnische Universität Berlin b e rl in FACHBEREICH 3 MATHEMATIK
There has been recent success in using polyhedral formulations of scheduling problems not only to obtain good lower bounds in practice but also to develop provably good approximation algorithms. Most of these formulations rely on binary decision variables that are a kind of assignment variables. We present quite simple polynomial{ time approximation algorithms that are based on linear programmi...
متن کاملScheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
We consider the single machine parallel-batching scheduling problem with precedence relations, release dates and identical processing times to minimize a regular objective function. When the processing times are unit, we give an O(n) time optimal algorithm. When there are no precedence relations, we solve this problem by dynamic programming in O(n) time. When the precedence relations are “layer...
متن کامل