An Approximate Algorithm for the Partitionable Independent Task Scheduling Problem

@inproceedings{Belkhale1990AnAA,
  title={An Approximate Algorithm for the Partitionable Independent Task Scheduling Problem},
  author={Krishna P. Belkhale and Prithviraj Banerjee},
  booktitle={ICPP},
  year={1990}
}
The problem presented in this paper is a generalization of the usual coupled-tasks scheduling problem in presence of compatibility constraints. The reason behind this study is the data acquisition problem for a submarine torpedo. We investigate a particular configuration for coupled-tasks (any task is divided into two sub-tasks separated by an idle time), in which the idle time of a coupled-task is equal to the sum of its two sub-tasks. We prove NP-completeness of the minimization of the… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 46 extracted citations

A Low Complex Scheduling Algorithm for Multi-processor System-on-Chip.

Parallel and Distributed Computing and Networks • 2005
View 11 Excerpts
Highly Influenced

A Complex Task Scheduling Scheme for Big Data Platforms Based on Boolean Satisfiability Problem

2018 IEEE International Conference on Information Reuse and Integration (IRI) • 2018
View 1 Excerpt

Scheduling Monotone Moldable Jobs in Linear Time

2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS) • 2018
View 3 Excerpts

Scheduling Parallel Tasks under Multiple Resources: List Scheduling vs. Pack Scheduling

2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS) • 2018
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Rao Arikati and C . Pandu Rangan . Linear algorithm for optimal path cover problem on interval graphs

K. H. Ecker Blazewicz, T. Kis, M. Tanas
Information Processing Letters • 1990

Optimization and approximation in deterministic sequencing and scheduling: a survey

R. L. Graham, E. L. Lawler, J. K. Lenstra, A.H.G. Rinnooy Kan
Annals of Discrete Mathematics, • 1979
View 1 Excerpt

On covering the points of a graph with point-disjoint paths

F. T. Boesch S. Chen, B. McHugh
Graphs and Combinatorics, • 1974
View 3 Excerpts

Similar Papers

Loading similar papers…