Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay

Authors:
Alix Munier Kordon
Affiliations:
Laboratoire LIP6, 4 place Jussieu, 75 252 Paris Cedex 05, France
Venue:
Operations Research Letters
Year:
2004

Citing 9
Cited 1

On some variants of the bandwidth minimization problem

SIAM Journal on Computing
Scheduling expressions on a pipelined processor with a maximal delay of one cycle

ACM Transactions on Programming Languages and Systems (TOPLAS)
Scheduling project networks with resource constraints and time windows

Annals of Operations Research
Scheduling time-critical instructions on RISC machines

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The one-machine problem with delayed precedence constraints and its use in job shop scheduling

Management Science
Parallel processor scheduling with delay constraints

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Deterministic Scheduling with Pipelined Processors

IEEE Transactions on Computers
One-machine generalized precedence constrained scheduling problems

Operations Research Letters
A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays

Operations Research Letters

Scheduling of tasks with precedence delays and relative deadlines - framework for time-optimal dynamic reconfiguration of FPGAs

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the makespan minimization for a unit execution time task sequencing problem with a bipartite precedence delays graph and a positive precedence delay d. We prove that the associated decision problem is strongly NP-complete and we provide a non-trivial polynomial sub-case. We also give an approximation algorithm with ratio 32.