A solution procedure for solving the nonrectangular cutting stock problem of the clothing industry using expert knowledge within an intelligent CAD environment

  • D. A. Xerokostas
  • K. G. Aravossis
Industrial Applications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 856)


A certain type of the cutting stock problem arises in the clothing industry. It is of the general non-rectangular two-dimensional type, but involves special considerations and restrictions. The solution procedure usually followed in the clothing industry is based on the experience of technicians, who use their skills to determine satisfactory cutting patters on the cutting table. In this paper a solution procedure for solving this problem-type is presented, which on a CAD environment combines O.R techniques and heuristics with expert knowledge for cutting-pattern generation. It produces a final cutting solution, which fully satisfies the orders for various garment-types. In the final stage of the solution-procedure the non-rectangular cutting stock problem is transformed into a rectangular one, that can be solved by means of heuristic methods. Numerical examples taken from the clothing industry demonstrate the efficiency of this procedure.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1).
    Adamowicz M., Albano A. (1972), “A two-stage solution of the Cutting Stock Problem”, Information Processing, No.71, pp. 1086–1091.Google Scholar
  2. 2).
    Adamowicz M., Albano A. (1976b), “A solution of the rectangular cutting stock problem”, IEEE Transactions on Systems, Man and Cybernetics Vol SMC-6 pp. 302–310.Google Scholar
  3. 3).
    Albano A. (1977), “A method to improve two-dimensional layout, CAD Vol.9, 1977, No.1, pp.48–52.Google Scholar
  4. 4).
    Albano A., Sapuppo G. (1980), “Optimal allocation of two dimensioanl irregular shapes using heuristic search methods:, IIEE Transactions SMC-10 5th May, pp.242–248.Google Scholar
  5. 5).
    Aravossis K., Xerokostas D. (1993). “A heuristic solution approach to a special type of the rectangular cutting stock Problem”. 2nd Balkan Conference on O.R 18–21 October 1993, Thessaloniki, Greece.Google Scholar
  6. 6).
    Beasley J.E (1985a), “Algorithm for Unconstrained Two-Dimensional Guillotine Cutting”, Journal of the O.R. Society, Vol. 36, pp. 297–306.Google Scholar
  7. 7).
    Christofides N., Whitlock C. (1977), “An algorithm for two dimensional Cutting Problems, O.R., Vol.25, No.1, pp. 31–44.Google Scholar
  8. 8).
    Dagli C.H., TATOGLUM, Y. (1987), “An approach to two-dimensional cutting stock Problmes”, Int.J.Prod.Res., Vol.25, No.2, pp.175–190.Google Scholar
  9. 9).
    Gilmore P.C. and Gomory R.E. (1965), “Multistage Cutting Stock Problems of two and more dimensions”, O.R., Vol.11, pp.863–888.Google Scholar
  10. 10).
    Gilmore P.C. and Gomory R.E. (1966), “The Theory and Computation of knapsack Functions”, O.R., Vol.13, pp.1045–1074.Google Scholar
  11. 11).
    Haims M.J, Freeman H. (1970), “A multistage solution of the template-layout problem”, IEEE Transactions on Systems Science and Cybernetics, Vol. 55c-6, No.2, pp.145–151.Google Scholar
  12. 12).
    Hertz J. (1972), “Recursive computational procedure for two-dimensional stock cutting”, IBM Journal of Research and Development, Vol.16, pp.462–469.Google Scholar
  13. 13).
    Jorn OIAN et al (1976), “An Interactive Computer Graphics approach to the problem of nesting plane parts on a raw steel format”, CAD, Proceedings, pp. 166–170.Google Scholar
  14. 14).
    Oliveira J.F., Ferreira J.S. (1990), “An improved version of Wang's algorithm for two-dimensional cutting problems, European Journal of O.R., Vol.44, No.2, pp.256–266.Google Scholar
  15. 15).
    Wang P.Y. (1983), “Two algorithms for constrained two-dimensional cutting stock problems”, O.R., Vol.31, No.3, pp.573–586.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • D. A. Xerokostas
    • 1
  • K. G. Aravossis
    • 1
  1. 1.Department of Production Management & Operations ResearchNTU AthensGreece

Personalised recommendations