Showing 1 - 10 of 351
Container loading is a pivotal function for operating supply chains efficiently. Underperformance results in unnecessary costs (e.g. cost of additional containers to be shipped) and in an unsatisfactory customer service (e.g. violation of deadlines agreed to or set by clients). Thus, it is not...
Persistent link: https://www.econbiz.de/10010548438
items. The cutting cost often increases with the number of cuts required. This paper focuses on the rectangular two …-dimensional cutting stock problem, where three-staged guillotine patterns are used, and the objective is to minimize the sum of plate and … cutting costs. The column generation framework is used to solve the problem. It uses a pattern-generation procedure to obtain …
Persistent link: https://www.econbiz.de/10010574153
This paper investigates the circular open dimension problem (CODP), which consists of packing a set of circles of known …
Persistent link: https://www.econbiz.de/10011052401
-dimensional stock cutting problem. Column widths are evaluated for several objective functions. Two approaches are proposed. The first …
Persistent link: https://www.econbiz.de/10011052683
Container loading is a pivotal function for operating supply chains efficiently. Underperformance results in unnecessary costs (e.g. cost of additional containers to be shipped) and in an unsatisfactory customer service (e.g. violation of deadlines agreed to or set by clients). Thus, it is not...
Persistent link: https://www.econbiz.de/10011052729
We examine the 2D strip packing problems with guillotine-cut constraint, where the objective is to pack all rectangles … orthogonal rectangular packing problems into a single coherent algorithm: (1) packing a block of rectangles instead of a single …
Persistent link: https://www.econbiz.de/10011097861
heuristic algorithm is presented to solve the rectangular two-dimensional single stock size cutting stock problem with two … reducing the number of plates used than a published algorithm and a commercial stock cutting software package. …
Persistent link: https://www.econbiz.de/10010682504
The multiple container loading cost minimization problem (MCLCMP) is a practical and useful problem in the transportation industry, where products of various dimensions are to be loaded into containers of various sizes so as to minimize the total shipping cost. The MCLCMP can be naturally...
Persistent link: https://www.econbiz.de/10010597634
In the three-dimensional strip packing problem (3DSP), we are given a container with an open dimension and a set of …
Persistent link: https://www.econbiz.de/10010597678
This paper presents a constraint programming approach for a batch processing machine on which a finite number of jobs of non-identical sizes must be scheduled. A parallel batch processing machine can process several jobs simultaneously and the objective is to minimize the maximal lateness. The...
Persistent link: https://www.econbiz.de/10010597703