Partial precedence constrained scheduling

IEEE Transactions on Computers

Volumn 48, Issue 10, 1999, Pages 1127-1130

  Chakrabarti, P P ^a,b  

^a IEEE   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

NP completeness; Precedence constraints; Scheduling; Shortest path algorithms

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; MATHEMATICAL MODELS;

PRECEDENCE CONSTRAINTS; SHORTEST-PATH ALGORITHMS;

RESPONSE TIME (COMPUTER SYSTEMS);

EID: 0033204544     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.805161     Document Type: Article

References (15)

1. Computer and Job Shop Scheduling Theory, E.G. Coffman Jr., ed. John Wiley & Sons, 1976.
2. J.A. Barnett and T. Verma, "Intelligent Reliability Analysis," Proc. 10th IEEE Conf. Artificial Intelligence for Applications, pp. 428-433, 1994.
3. D. Torrieri, "Calculation of Node-Pair Reliability in Large Networks with Unreliable Nodes," IEEE Trans. Reliability, vol. 43, no. 3, pp. 375-377, 1994.
4. J. Duato, S. Yalamanchili, and L. Ni, Interconnection Networks: An Engineering Approach. Los Alamitos, Calif.: IEEE CS Press, 1997.
5. T. Cao and A.C. Sanderson, "And/Or Net Representation for Robotic Task Sequence Planning," IEEE Trans. Systems, Man, and Cybernetics - Part C, vol. 28, no. 2, pp. 204-218, 1998.
6. M. Barbehenn and S. Hutchinson, "Efficient Search and Hierarchical Motion Planning by Dynamically Maintaining Single-Source Shortest Path Trees," IEEE Trans. Robotics and Automation, vol. 11, no. 2, pp. 198-214, 1995.
7. L.S.H. De Mello and A.C. Sanderson, "A Correct and Complete Algorithm for Generation of Mechanical Assembly Sequences," IEEE Trans. Robotics and Automation, vol. 7, no. 2, pp. 228-240, 1991.
8. M. Goldwasser, J.C. Latombe, and R. Motwani, "Complexity Measures for Assembly Sequences," Proc. IEEE Conf. Robotics and Automation, pp. 1,851-1,857, Apr. 1996.
9. M. Goldwasser and R. Motwani, "Intractability of Assembly Sequencing: Unit Disks in the Plane," Proc. Workshop Algorithms and Data Structures, pp. 307-320, 1997.
10. N. Chamamaiah and B. Ramamurthy, "Finding Shortest Paths in Distributed Loop Networks," Information Processing Letters, vol. 67, pp. 157-161, 1998.
11. E.W. Dijkstra, "A Note on Two Problems in Connection with Graphs," Numerische Mathematik, vol. 1, pp. 269-271, 1959.
12. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. MIT Press and McGraw-Hill, 1990.
13. M. Barbehenn, "A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices," IEEE Trans. Computers, vol. 47, no. 2, p. 263, Feb. 1998.
14. S. Sahni, "Computationally Related Problems," SIAM J. Computing, vol. 3, no. 4, pp. 262-279, 1974.
15. E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms. Computer Science Press, 1984.