
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ira Pramanick, Jon G. Kuhl, "An Inherently Parallel Method for Heuristic ProblemSolving: Part IIExample Applications," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 10, pp. 10161028, October, 1995.  
BibTex  x  
@article{ 10.1109/71.473512, author = {Ira Pramanick and Jon G. Kuhl}, title = {An Inherently Parallel Method for Heuristic ProblemSolving: Part IIExample Applications}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {6}, number = {10}, issn = {10459219}, year = {1995}, pages = {10161028}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.473512}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  An Inherently Parallel Method for Heuristic ProblemSolving: Part IIExample Applications IS  10 SN  10459219 SP1016 EP1028 EPD  10161028 A1  Ira Pramanick, A1  Jon G. Kuhl, PY  1995 KW  Superexponential complexity KW  flowshop scheduling KW  jobshop scheduling KW  vertex cover KW  heuristics. VL  6 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] M. Garey and D.S. Johnson,Computers and Intractability.San Francisco: Freeman, 1979.
[2] E. Horowitz and S. Sahni,Algorithms: Design and Analysis.Potomac, Md.: Computer Science Press, 1978.
[3] T. Gonzalez and S. Sahni,“Flowshop and jobshop schedules: Complexity and approximation,” Operations Research, vol. 26, pp. 3652, Jan.Feb. 1978.
[4] M. O’hEigeartaigh,J.K. Lenstra,, and A.H.G. Rinnooy Kan, eds., Combinatorial Optimization: Annotated Bibliographies.New York: John Wiley, 1985.
[5] A. Kusiak,Intelligent Manufacturing Systems.Englewood Cliffs, N.J.: Prentice Hall, 1990.
[6] S. French,, Sequencing and Scheduling: An Introduction to the Mathematics ofthe JobShop.Chichester, England: Ellis Horwood Ltd., 1982.
[7] K.E. Baker,Introduction to Sequencing and Scheduling.New York: John Wiley, 1974.
[8] S.M. Johnson,“Optimal two and threestage production schedules with setuptimes,” Naval Research Logistics Quarterly, vol. 1, no. 1, pp. 6168, 1954.
[9] J. Blazewicz,“Scheduling under resource constraints_deterministic models,” Annals of Operations Research, vol. 7, no. 14, 1986.
[10] M.R. Garey,D.S. Johnson,, and R. Sethi,“The complexity of flowshop and jobshop scheduling,” Mathematics of Operations Research, vol. 1, no. 2, pp. 117129, 1976.
[11] J.G. Shanthikumar and Y.B. Wu,“Decomposition approaches in permutation scheduling with application to the Mmachine flow shop schedulingproblems,” European J. of Operations Research, vol. 19, pp. 125141, 1985.
[12] B.J. Lagweg,L.K. Lenstra,, and R. Kan,“A general bounding scheme for permutation flow shop problem,” Operations Research, vol. 26, pp. 5367, 1978.
[13] G. Li and B.W. Wah,“Computational efficiency of parallel approximate branchandbound algorithms,” Proc. 1984 Int’l Conf. on Parallel Processing, pp. 473480, 1984.
[14] T.H. Lai and S. Sahni,“Anomalies in parallel branchandbound algorithms,” Proc. 1983 Int’l Conf. on Parallel Processing, pp. 183190, 1983.
[15] B.W. Wah and Y.Q. Ma,“MANIP—a parallel computer system for implementing branchandbound algorithms,” Proc. 8th Ann. Symp. on Computer Architecture, pp. 239262, 1982.
[16] I. Pramanick,“Parallel dynamic interaction—an inherently parallel problemsolving methodology,” PhD thesis, Department of Electrical and Computer Engineering.,The University of Iowa, May 1991.
[17] G.L. Nemhauser and L.E. Trotter,“Vertex packings: Structural properties and algorithms,” Mathematical Programming, vol. 8, pp. 232248, 1975.
[18] E. Balas and H. Samuelsson,“A node covering algorithm,” Naval Research Logistics Quarterly, vol. 24, no. 2, pp. 213233, 1977.
[19] R. BarYehuda and S. Even,“On approximating a vertex cover for planar graphs,” Proc. 14th Ann. ACM Symp. on Theory of Computing, pp. 303309, May 1982.
[20] R. Levinson,“Towards more optimal vertex covers,” Technical Report UCSCCRL8903, Computer Research Laboratory,Univ. of California at Santa Cruz, Mar. 1989.
[21] R. BarYehuda and S. Even,“A localratio theorem for approximating the weighted vertex cover problem,” Annals of Discrete Mathematics, vol. 25, pp. 2746, 1985.
[22] R. BarYehuda and S. Even,“A lineartime approximation algorithm for the weighted vertex cover problem,” J. of Algorithms, vol. 2, pp. 198203, 1981.
[23] B. Monien and E. Speckenmeyer,“Some further approximation algorithms for the vertex cover problem,” Lecture Notes in Computer Science, vol. 159, pp. 341349, 1983.
[24] D.S. Hochbaum,“Approximation algorithms for the set covering and vertex cover problems,” SIAM J. of Computing, vol. 11, no. 3, pp. 555556, Aug. 1982.
[25] R. BarYehuda,“Approximating vertex covers,” private communication, Aug. 1990.
[26] V. Chvatal,“A greedy heuristic for the setcovering problem,” Mathematics of Operations Research, vol. 4, no. 3, pp. 233235, Aug. 1979.
[27] F. Brglez,D. Bryan,, and K. Kozminski,“Combinational Profiles of sequential benchmark circuits,” Proc. Int’l Symp. on Circuits and Systems, pp. 1,9291,934, May 1989.
[28] I. Pramanick,“Application of a parallel heuristic framework to the set covering problem,” Proc. 1992 Int’l Conf. on Parallel Processing, pp. III185III189, Aug. 1992.
[29] G. Jain,B. Ramkumar,, and J. Kuhl,“A control strategy based on heuristic techniques for the parallel execution of logic programs,” Proc. Eighth Int’l Parallel Processing Symp., pp. 311315, Apr. 1994.