The Sriwijaya University Library

  • Home
  • Information
  • News
  • Help
  • Librarian
  • Login
  • Member Area
  • Select Language :
    Arabic Bengali Brazilian Portuguese English Espanol German Indonesian Japanese Malay Persian Russian Thai Turkish Urdu

Search by :

ALL Author Subject ISBN/ISSN Advanced Search

Last search:

{{tmpObj[k].text}}
Image of IMPLEMENTASI ALGORITMA GREEDY HEURISTIC DALAM PENENTUAN POLA PEMOTONGAN OPTIMAL PADA CUTTING STOCK PROBLEM DUA DIMENSI PERCETAKAN XXX DI KOTA PALEMBANG

Text

IMPLEMENTASI ALGORITMA GREEDY HEURISTIC DALAM PENENTUAN POLA PEMOTONGAN OPTIMAL PADA CUTTING STOCK PROBLEM DUA DIMENSI PERCETAKAN XXX DI KOTA PALEMBANG

Puspita, Ega - Personal Name;

Penilaian

0,0

dari 5
Penilaian anda saat ini :  

Optimizing the cutting pattern has an important role for the printing industry in determining the cutting pattern of raw materials (stock) to increase profits and minimize trim loss. Trim loss is the remnant of cutting paper that can’t be used anymore. This study optimized the cutting patterns in the two-dimensional Cutting Stock Problem of an XXX printing in Palembang, where the cutting process only considers the width and length of raw materials, resulting in a trim loss on both sides. We used the Gilmore and Gomory model and then solved it with the Greedy Heuristic Algorithm. The optimal solution from the Greedy Heuristic algorithm will then be compared with the solution from the Genetic algorithm that has been obtained in previous studies. Based on the results and discussion, there are five optimal cutting pattern based on the width, namely the 1st, 2nd, 3rd, 4th, and 5th cutting patterns, and five optimal cutting patterns on the length, namely the 3rd, 4th,6th, 7th, and 8th cutting patterns. The Greedy Heuristic Algorithm produces fewer combinations of cutting patterns than the Genetic Algorithm. Keywords: Cutting Stock Problem, Gilmore and Gomory, Greedy Heuristic, Cutting Pattern.


Availability
Inventory Code Barcode Call Number Location Status
2207001110T65647T656472022Central Library (Referens)Available but not for loan - Not for Loan
Detail Information
Series Title
-
Call Number
T656472022
Publisher
Inderalaya : Jurusan Matematika, Fakultas Matematika Dan Ilmu Pengetahuan Alam Universitas Sriwijaya., 2022
Collation
x, 63 hlm.; ilus.; 29 cm
Language
Indonesia
ISBN/ISSN
-
Classification
518.107
Content Type
-
Media Type
-
Carrier Type
-
Edition
-
Subject(s)
Algoritma
Jurusan Matematika
Specific Detail Info
-
Statement of Responsibility
SEPTA
Other version/related

No other version available

File Attachment
  • IMPLEMENTASI ALGORITMA GREEDY HEURISTIC DALAM PENENTUAN POLA PEMOTONGAN OPTIMAL PADA CUTTING STOCK PROBLEM DUA DIMENSI PERCETAKAN XXX DI KOTA PALEMBANG
Comments

You must be logged in to post a comment

The Sriwijaya University Library
  • Information
  • Services
  • Librarian
  • Member Area

About Us

As a complete Library Management System, SLiMS (Senayan Library Management System) has many features that will help libraries and librarians to do their job easily and quickly. Follow this link to show some features provided by SLiMS.

Search

start it by typing one or more keywords for title, author or subject

Keep SLiMS Alive Want to Contribute?

© 2025 — Senayan Developer Community

Powered by SLiMS
Select the topic you are interested in
  • Computer Science, Information & General Works
  • Philosophy & Psychology
  • Religion
  • Social Sciences
  • Language
  • Pure Science
  • Applied Sciences
  • Art & Recreation
  • Literature
  • History & Geography
Icons made by Freepik from www.flaticon.com
Advanced Search