Time complexity of single machine scheduling with stochastic precedence constraints

This paper deals with single machine scheduling problems with stochastic precedence relations (so calledGERT networks). Until now most investigations on such problems, dealt with algorithms running in polynomial time. On the other hand, for scheduling problems with deterministic precedence relations exist a lot of results about time complexity. Therefore, the object of this paper is to consider time complexity of scheduling problems with stochastic precedence constraints and to describe the boundary between theNP-hard problems and those which can be solved in polynomial time.

[1]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[2]  Jan Karel Lenstra,et al.  Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  K. Neumann,et al.  GERT networks and the time-oriented evaluation of projects , 1979 .

[5]  Matthias Bücker.  Ein-Maschinen-Scheduling-Probleme mit stochastischen Reihenfolgebeziehungen unter besonderer Berücksichtigung polynomialer Algorithmen , 1990 .

[6]  Michael Pinedo.  On the Computational Complexity of Stochastic Scheduling Problems , 1982 .

[7]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[8]  Salah E. Elmaghraby,et al.  Activity networks: Project planning and control by network models , 1977 .

[9]  Greg N. Frederickson,et al.  Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan , 1981, JACM.

[10]  Klaus Neumann,et al.  Algorithms for single-machine scheduling with stochastic outtree precedence relations to minimize expected weighted flow time or maximum expected lateness , 1994, Math. Methods Oper. Res..

[11]  Jan Karel Lenstra,et al.  Recent developments in deterministic sequencing and scheduling: a survey : (preprint) , 1981 .

[12]  Klaus Neumann,et al.  Stochastic Project Networks , 1990 .

[13]  Eugene L. Lawler,et al.  Optimal Sequencing of a Single Machine Subject to Precedence Constraints , 1973 .