Partial Precedence Constrained Scheduling

Authors:
P. P. Chakrabarti
Affiliations:
Indian Institute of Technology, Kharagpur, India
Venue:
IEEE Transactions on Computers
Year:
1999

Citing 7
Cited 0

Introduction to algorithms

Introduction to algorithms
A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices

IEEE Transactions on Computers
Finding shortest paths in distributed loop networks

Information Processing Letters
Interconnection Networks: An Engineering Approach

Interconnection Networks: An Engineering Approach
Fundamentals of Computer Alori

Fundamentals of Computer Alori
Intractability of Assembly Sequencing: Unit Disks in the Plane

WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
AND/OR net representation for robotic task sequence planning

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews

Quantified Score

Hi-index	14.98

Visualization

Abstract

This paper presents a generalized formulation of precedence constrained scheduling where the number of dependent tasks which are to be scheduled before the task itself can be scheduled is a variable. This formulation is capable of modeling a number of scheduling and path-finding problems. An algorithm is presented to solve the problem of finding the minimum time schedule. Variants are discussed. One simple variant is shown to be NP-Complete.