Scheduling results applicable to decision-theoretic troubleshooting

In decision-theoretic troubleshooting, we are given a Bayesian network model of a malfunctioning device and our task is to find a repair strategy with minimal expected cost. The troubleshooting problem has received considerable attention over the past two decades. We show that several troubleshooting scenarios proposed in the literature are equivalent to well-studied machine scheduling problems. This immediately yields new complexity-theoretic and algorithmic results for troubleshooting. We also apply scheduling results to multi-agent troubleshooting. Further, we examine the so-called call service action which is often used in troubleshooting but has no natural counterpart in machine scheduling. We show that adding the call service action to basic troubleshooting models does not make the problem intractable. New NP -hardness results for troubleshooting problems are given.Polynomial-time solvable special cases of the NP -hard problems are discussed.A close connection between troubleshooting and scheduling problems is described.Basic troubleshooting with call-service action is shown to be solvable in O ( n log ? n ) time.

[1]  H. Simon,et al.  Optimal Strategies for a Class of Constrained Sequential Problems , 1977 .

[2]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[3]  Václav Lín.  Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints , 2011, ECSQARU.

[4]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[5]  L. Trevisan.  On Khot’s unique games conjecture , 2012 .

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

[7]  Tonguç Ünlüyurt,et al.  Sequential testing of complex systems: a review , 2004, Discret. Appl. Math..

[8]  Roel Leus,et al.  Sequential testing policies for complex systems under precedence constraints , 2012, IEEM 2012.

[9]  Peter Brucker,et al.  Complexity results for parallel machine problems with a single server , 2002 .

[10]  Vadim G. Timkovsky,et al.  Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity , 2003, Eur. J. Oper. Res..

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

[12]  B. Gluss.  An Optimum Policy for Detecting a Fault in a Complex System , 1959 .

[13]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[14]  E. Lawler.  Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .

[15]  Finn V. Jensen,et al.  Bayesian Networks and Decision Graphs , 2001, Statistics for Engineering and Information Science.

[16]  Martin Fürer,et al.  Faster integer multiplication , 2007, STOC '07.

[17]  Sanjeev Khanna,et al.  Approximation Algorithms for Minimizing AverageWeighted Completion Time , 2004, Handbook of Scheduling.

[18]  George Steiner,et al.  Optimal Sequencing by Modular Decomposition: Polynomial Algorithms , 1986, Oper. Res..

[19]  Mikhail Y. Kovalyov,et al.  Optimal testing and repairing a failed series system , 2006, J. Comb. Optim..

[20]  Kenneth H. Rosen.  Handbook of Discrete and Combinatorial Mathematics , 1999 .

[21]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[22]  Helge Langseth,et al.  Heuristics for Two Extensions of Basic Troubleshooting , 2001, SCAI.

[23]  Rolf H. Möhring,et al.  Computationally Tractable Classes of Ordered Sets , 1989 .

[24]  Peter Brucker.  Scheduling algorithms (4. ed.) , 2004 .

[25]  Clyde L. Monma,et al.  Sequencing with Series-Parallel Precedence Constraints , 1979, Math. Oper. Res..

[26]  Jay B. Ghosh.  Batch scheduling to minimize total completion time , 1994, Oper. Res. Lett..

[27]  Clyde L. Monma,et al.  Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions , 1987, Math. Oper. Res..

[28]  Ludek Kucera,et al.  Combinatorial Algorithms , 1989 .

[29]  Donald E. Knuth,et al.  The Art of Computer Programming, Vol. 2 , 1981 .

[30]  Niels Möller.  On Schönhage's algorithm and subquadratic integer gcd computation , 2008, Math. Comput..

[31]  Václav Lín,et al.  Decision-theoretic troubleshooting: Hardness of approximation , 2013, Int. J. Approx. Reason..

[32]  David Heckerman,et al.  Decision-theoretic troubleshooting , 1995, CACM.

[33]  Mihalis Yannakakis,et al.  Batch sizing and job sequencing on a single machine , 1991 .

[34]  Eugene L. Lawler,et al.  Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.

[35]  Finn Verner Jensen,et al.  The Cost of Troubleshooting Cost Clusters with Inside Information , 2010, UAI.

[36]  R. Leus,et al.  Complexity analysis of the discrete sequential search problem with group activities , 2013, 2013 IEEE International Conference on Industrial Engineering and Engineering Management.

[37]  Ola Svensson,et al.  On the Approximability of Single-Machine Scheduling with Precedence Constraints , 2011, Math. Oper. Res..

[38]  Jirí Vomlel,et al.  The SACSO methodology for troubleshooting complex systems , 2001, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[39]  T. C. Edwin Cheng,et al.  One-machine batching and sequencing of multiple-type items , 1994, Comput. Oper. Res..

[40]  Bret J. Wagner,et al.  Discrete Sequential Search with Group Activities , 2001, Decis. Sci..

[41]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[42]  Finn V. Jensen,et al.  When to test? Troubleshooting with postponed system test , 2011, Expert Syst. Appl..

[43]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[44]  Mark A. Shayman,et al.  Risk-sensitive decision-theoretic diagnosis , 2001, IEEE Trans. Autom. Control..

[45]  Marta Vomlelová,et al.  Complexity of decision‐theoretic troubleshooting , 2003, Int. J. Intell. Syst..

[46]  Subhash Khot,et al.  Optimal Long Code Test with One Free Bit , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[47]  Monaldo Mastrolilli,et al.  Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem , 2009, Algorithmica.

[48]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[49]  Jirí Vomlel,et al.  Troubleshooting: NP-hardness and solution methods , 2003, Soft Comput..

[50]  Joseph Y.-T. Leung,et al.  Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time , 1991, Inf. Comput..

[51]  Sanjeev Khanna,et al.  Approximation Algorithms for Minimizing AverageWeighted Completion Time , 2004, Handbook of Scheduling.

[52]  Susanne Albers,et al.  The Complexity of One-Machine Batching Problems , 1993, Discret. Appl. Math..

[53]  Thorsten J. Ottosen.  Solutions and Heuristics for Troubleshooting with Dependent Actions and Conditional Costs , 2012 .

[54]  P. Muliere,et al.  Optimal sequential testing for an inverse Gaussian process , 2016 .

[55]  R Bellman,et al.  On the Theory of Dynamic Programming. , 1952, Proceedings of the National Academy of Sciences of the United States of America.

[56]  Gerhard J. Woeginger,et al.  A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines , 2000, Math. Oper. Res..

[57]  Anna Pernestål,et al.  Probabilistic Fault Diagnosis with Automotive Applications , 2009 .

[58]  Edward G. Coffman,et al.  Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

[59]  Håkan Warnquist,et al.  Computer-Assisted Troubleshooting for Efficient Off-board Diagnosis , 2011 .