Design and implementation of a parallel solution to the cutting stock problem

Concurrency Practice and Experience

Volumn 10, Issue 10, 1998, Pages 783-805

  Nicklas, Lisa D ^a   Atkins, Robert W ^a   Setia, Sanjeev K ^a   Wang, Pearl Y ^a  

^a Krasnow Institute for Advanced Study   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION; COMPUTER WORKSTATIONS; DATA STRUCTURES; NETWORK PROTOCOLS; SYNCHRONIZATION;

CUTTING STOCK;

INVENTORY CONTROL;

EID: 0346547452     PISSN: 10403108     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1096-9128(19980825)10:10<783::AID-CPE375>3.0.CO;2-C     Document Type: Article

References (23)

1. E. E. Bischoff and G. Wäscher, 'Cutting and packing', Eur. J. Oper. Res., 84, 503-505 (1995).
2. K. A. Dowsland and W. B. Dowsland, 'Packing problems', Eur. J. Oper. Res., 56, 2-14 (1992).
3. H. Dyckhoff, 'A typology of cutting and packing problems', Eur. J. Oper. Res., 44, 145-149 (1990).
4. R. W. Haessler and P. E. Sweeney, 'Cutting stock problems and solution procedures', Eur. J. Oper. Res., 54, 141-150 (1991).
5. W. W. Adams and P. Loustanau, An Introduction to Gröbner Bases, American Mathematical Society, Providence, Rhode Island, 1994.
6. S. Setia and P. Y. Wang, 'Solving a highly irregular problem on distributed memory computers', in Proceedings of the 1995 International Conference on Parallel Processing Workshop on Challenges for Parallel Processing, Oconomowoc, WI, 1995, pp. 155-162.
7. P. Y. Wang, 'Two algorithms for constrained two-dimensional cutting stock problems', Oper. Res., 31(3), 573-586 (1983).
8. S. Tschöke and N. Holthöfer, 'A new parallel approach to the constrained two-dimensional cutting stock problem', in A. Ferreira and J. Rolim (Eds), Parallel Algorithms for Irregularly Structured Problems, Springer-Verlag, Berlin, Germany, 1995, pp. 285-300.
9. B. Kröger and O. Vornberger, 'Solving a cutting stock problem on a transputer network', in Proceedings of the Second Conference of the North American Transputer Users Group, Durham, North Carolina, 1990, pp. 393-404.
10. P. C. Gilmore and R. E. Gomory, The theory and computation of knapsack functions', Oper. Res., 4, 1045-1075 (1966).
11. N. Christofides and C. Whitlock, 'An algorithm for two-dimensional cutting problems', Oper. Res., 25, 30-44 (1975).
12. J. F. Oliveira and J. S. Ferreira, 'An improved version of Wang's algorithm for two-dimensional cutting problems', Eur. J. Oper. Res., 44, 256-266 (1990).
13. F. Vasko, 'A computational improvement to Wang's two-dimensional cutting stock algorithm', Comput. Ind. Eng., 16(1), 109-115 (1989).
14. K. V. Viswanathan and A. Bagchi, 'Best-first search methods for constrained two-dimensional cutting stock problems', Oper. Res., 41(4), 256-776 (1993).
15. B. A. Skalbeck and H. K. Schultz, 'Reducing trim waste in panel cutting using integer and linear programming', in Proceedings of the Western AIDS Conference, March, 1976.
16. H. E. Bal, M. F. Kaashoek, A. S. Tannenbaum and J. Jansen, 'Replication techniques for speeding up parallel applications on distributed systems', Concurrency: Pract. Exper., 4(5), 337-355 (1992).
17. S. Chakrabarti and K. Yelick, 'Implementing an irregular application on a distributed memory multiprocessor', in Proceedings of the Fourth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, ACM SIGPLAN Not., 28(7), (1993).
18. H. Shah and J. Fortes, 'A quasi-barrier technique to improve performance of an irregular application', in Proceedings of Frontiers '96 The Sixth Symposium on the Frontiers of Massively Parallel Computation, October 1996, pp. 263-270.
19. R. D. Blumofe and C. E. Leiserson, 'Scheduling multithreaded computations by work stealing', in Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, November 1994.
20. S. Adve and M. Hill, 'Weak ordering: A new definition', in Proceedings of the 17th International Symposium on Computer Architecture, May 1990, pp. 21-14.
21. P. Keleher, A. L. Cox and W. Zwaenepoel, 'Lazy release consistency for software distributed shared memory', in Proc. of the 19th International Sympsium on Computer Architecture, May 1992, pp. 13-21.
22. V. S. Sundaram, 'PVM: A framework for parallel distributed computing', Concurrency: Pract. Exper., 2(4), 315-339 (1990).
23. J. E. Beasley, 'OR-Library: Distributing test problems by electronic mail', J. Oper. Res. Soc., 41(11), 1069-1072 (1990). http://mscmga.ms.ic.ac.uk/info.html.