A Heuristic Approach for Integrated Nesting and Scheduling in Sheet Metal Processing

  • Tatsuhiko SakaguchiEmail author
  • Hayato Ohtani
  • Yoshiaki Shimizu
Conference paper
Part of the IFIP Advances in Information and Communication Technology book series (IFIPAICT, volume 459)


In recent years, sustainable and agile manufacturing is aimed at in many manufacturing industries. Reducing the waste of raw materials and managing the production schedule are important factors for such manufacturing. Nesting is an activity designing a cutting layout while scheduling is one managing operational procedures. Noting such nesting and scheduling in sheet metal processing, we need to consider those simultaneously for increasing the entire efficiency. This is because there often occurs a trade-off between them. To resolve such problem, we previously proposed an integrated method of nesting and scheduling. In order to enhance the scheduling ability that was insufficient in our method, this study extends the idea through a heuristic approach. Actually, we apply a local search to update the initial schedule which is decided by EDD based dispatching rule and manage it in terms of the criteria referring to the bottleneck process. Computational experiment is provided to validate the effectiveness of the proposed method.


Scheduling Nesting Dispatching rule Bottom left algorithm Sheet metal processing 



This research was partially supported by the Ministry of Education, Culture, Sports, Science and Technology, Grant-in-Aid, 15K17950, Japan.


  1. 1.
    Sakaguchi, T., Murakami, T., Fujita, S., Shimizu, Y.: A scheduling method with considering nesting for sheet metal processing. In: ASME/ISCIE 2012 International Symposium on Flexible Automation, St. Louis, ISFA2012-7197 (2012)Google Scholar
  2. 2.
    Sakaguchi, T., Matsumoto, K., Shimizu, Y.: Study on nesting scheduling for sheet metal processing (Improvement of nesting method by parts reallocation). Trans. JSME (in Japanese) 81(825), 14–00640 (2015)CrossRefGoogle Scholar
  3. 3.
    Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: a survey. Eur. J. Oper. Res. 141(2), 241–252 (2002)zbMATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    Baker, B.S., Coffman Jr., E.G., Rivest, R.L.: Orthogonal packing in two dimensions. SIAM J. Comput. 9, 846–855 (1980)zbMATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    Potts, C.N., Sevastjanov, S.V., Strusevich, V.A., Van Wassenhove, L.N., Zwaneveld, C.M.: The two-stage assembly scheduling problem: complexity and approximation. Oper. Res. 43(2), 346–355 (1995)zbMATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    Allahverdi, A., Al-Anzi, F.S.: A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application. Comput. Oper. Res. 33, 1056–1080 (2006)zbMATHCrossRefGoogle Scholar
  7. 7.
    Chryssolouris, G., Papakostas, N., Mourtzis, D.: A decision-making approach for nesting scheduling: a textile case. Int. J. Prod. Res. 38(17), 4555–4564 (2000)CrossRefGoogle Scholar
  8. 8.
    Verlinden, B., Cattrysse, D., Van Oudheusden, D.: Integrated sheet-metal production planning for laser cutting and bending. Int. J. Prod. Res. 45(2), 369–383 (2007)CrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2015

Authors and Affiliations

  • Tatsuhiko Sakaguchi
    • 1
    Email author
  • Hayato Ohtani
    • 1
  • Yoshiaki Shimizu
    • 1
  1. 1.Toyohashi University of TechnologyToyohashiJapan

Personalised recommendations