An Inherently Parallel Method for Heuristic Problem-Solving: Part II-Example Applications

For pt.I. see ibid., p.1006-15. This paper presents the application of parallel dynamic interaction (PDI) to three real problem domains: the flowshop scheduling problem, the job-shop scheduling problem and the vertex cover problem. Specific examples are provided as to how the general PDI framework, introduced in part I of this paper, can be applied to a particular problem. The results of an empirical study of 90 example instances of these problems indicate that PDI consistently out-performs previously published heuristics for the vertex cover problem, and can typically generate solutions within a few percent of optimal for flow-shop and job-shop problems. Out of the 76 examples for which the optimal solution could be determined, PDI was able to produce results averaging within 4% of optimal. In over 30% of the cases, PDI was able to find the optimal solution. In no case did the PDI solution deviate more than 15% from optimal. It is also seen that the time taken by PDI to arrive at these solutions is negligible compared to that taken by conventional search techniques. This provides strong empirical evidence that PDI is capable of generating high quality solutions to exponentially and super-exponentially hard problems in reasonably short periods of time. >

[1]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[2]  Egon Balas,et al.  A node covering algorithm , 1977 .

[3]  Reuven Bar-Yehuda,et al.  A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem , 1981, J. Algorithms.

[4]  Ira Pramanick.  Parallel dynamic interaction--an inherently parallel problem-solving methodology , 1992 .

[5]  Andrew Kusiak.  Intelligent Design and Manufacturing , 1992 .

[6]  Sartaj Sahni,et al.  Anomalies in Parallel Branch-and-Bound Algorithms , 1984 .

[7]  Robert B. FEINBERG.  The circular dimension of a graph , 1979, Discret. Math..

[8]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[9]  Ira Pramanick,et al.  Application of a Parallel Heuristic Framework to the Set Covering Problem , 1992, ICPP.

[10]  Jevaveerasingam Shanthikumar,et al.  Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems , 1985 .

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

[12]  Benjamin W. Wah,et al.  MANIP-a parallel computer system for implementing branch and bound algorithms , 1981, ISCA '81.

[13]  Jacek Blazewicz,et al.  Scheduling under resource constraints - deterministic models , 1986 .

[14]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[15]  B. J. Lageweg,et al.  A General Bounding Scheme for the Permutation Flow-Shop Problem , 1978, Oper. Res..

[16]  Reuven Bar-Yehuda,et al.  A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.

[17]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[18]  Ewald Speckenmeyer,et al.  Some Further Approximation Algorithms for the Vertex Cover Problem , 1983, CAAP.

[19]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[20]  Reuven Bar-Yehuda,et al.  On approximating a vertex cover for planar graphs , 1982, STOC '82.

[21]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

[22]  Dorit S. Hochbaum,et al.  Approximation Algorithms for the Set Covering and Vertex Cover Problems , 1982, SIAM J. Comput..

[23]  Jon G. Kuhl,et al.  A control strategy based on heuristic techniques for the parallel execution of logic programs , 1994, Proceedings of 8th International Parallel Processing Symposium.

[24]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[25]  David Bryan,et al.  Combinational profiles of sequential benchmark circuits , 1989, IEEE International Symposium on Circuits and Systems,.