On cutting stock with due dates

Arbib, Claudio; Marinelli, Fabrizio

doi:10.1016/j.omega.2014.01.004

Cited by 48 publications

(29 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…• n =20, 40, 60, 80, and 100; • i and τ i following the uniform [1,5]; ; and • classes of instance as given in Table 1. They are those of the most known benchmark set for two-dimensional bin packing [10].…”

Section: Computational Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Just-in-time batch scheduling problem with two-dimensional bin packing constraints

Polyakovskiy

Makarowsky

M’Hallah

2017

Proceedings of the Genetic and Evolutionary Computation Conference

View full text Add to dashboard Cite

This paper introduces and approximately solves a multi-component problem where small rectangular items are produced from large rectangular bins via guillotine cuts. An item is characterized by its width, height, due date, and earliness and tardiness penalties per unit time. Each item induces a cost that is proportional to its earliness and tardiness. Items cut from the same bin form a batch, whose processing and completion times depend on its assigned items. The items of a batch have the completion time of their bin. The objective is to find a cutting plan that minimizes the weighted sum of earliness and tardiness penalties. We address this problem via a constraint programming (CP) based heuristic (CPH) and an agent based modelling heuristic (ABH). CPH is an impact-based search strategy, implemented in the general-purpose solver IBM CP Optimizer. ABH is constructive. It builds a solution through repeated negotiations between the set of agents representing the items and the set representing the bins. The agents cooperate to minimize the weighted earlinesstardiness penalties. The computational investigation shows that CPH outperforms ABH on small-sized instances while the opposite prevails for larger instances.

show abstract

Section: Computational Resultsmentioning

confidence: 99%

“…Applications combining bin packing and scheduling range from steel manufacturing [17,1] to ship lock scheduling [19] to wood cutting [13]. However, to the best of our knowledge, no research deals with JIT with BP introduced in this paper.…”

Section: Introductionmentioning

confidence: 99%

Just-in-time batch scheduling problem with two-dimensional bin packing constraints

Polyakovskiy

Makarowsky

M’Hallah

2017

Proceedings of the Genetic and Evolutionary Computation Conference

View full text Add to dashboard Cite

show abstract

“…In addition, the LS-CS problem can be integrated with cut-and-scheduling problems, similar to the research in [7], [9], and [11]. There are other LS-CS problems in furniture and other practical settings that involve relevant setup time and costs in the cutting and drilling processes, which are different from the one studied in this paper.…”

Section: Conclusion and Future Researchmentioning

confidence: 94%

Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem

Akartunalı²,

Jans

et al. 2017

INFORMS Journal on Computing

View full text Add to dashboard Cite

The coupled lot-sizing and cutting-stock problem has been a challenging and significant problem for industry, and has therefore received sustained research attention. The quality of the solution is a major determinant of cost performance in related production and inventory management systems, and therefore there is intense pressure to develop effective practical solutions. In the literature, a number of heuristics have been proposed for solving the problem. However, the heuristics are limited in obtaining high solution qualities. This paper proposes a new progressive selection algorithm that hybridizes heuristic search and extended reformulation into a single framework. The method has the advantage of generating a strong bound using the extended reformulation, which can provide good guidelines on partitioning and sampling in the heuristic search procedure so as to ensure an efficient solution process. We also analyze per-item and per-period Dantzig-Wolfe decompositions of the problem and present theoretical comparisons. The master problem of the per-period DantzigWolfe decomposition is often degenerate, which results in a tailing-off effect for column generation.We apply a hybridization of Lagrangian relaxation and stabilization techniques to improve the convergence. The discussion is followed by extensive computational tests, where we also perform detailed statistical analyses on various parameters. Comparisons with other methods indicate that our approach is computationally tractable and is able to obtain improved results.

show abstract

“…In some industrial applications, delivering the orders on time can be far more important than reducing the resulting waste and the cost of cut objects. Models that consider due dates in the formulation better describe the need of the industry in such a case ( Arbib & Marinelli, 2014;Bennell, Lee, & Potts, 2013;Braga, Alvez, Macedo, & de Carvalho, 2015Li, 1996;Reinertsen & Vossen, 2010 ).These papers combine the standard objective of minimizing the number of rolls used with a scheduling term penalizing the tardiness of the cutting operations. This problem is referred to in the literature as the combined Cutting Stock and Scheduling Problem ( CSSP ).…”

Section: Further Research Opportunitiesmentioning

confidence: 99%

Classification and literature review of integrated lot-sizing and cutting stock problems

Melega

Araújo

Jans

2018

European Journal of Operational Research

View full text Add to dashboard Cite

a b s t r a c tThe aim of this paper is to classify the literature related to the integration between the lot-sizing and cutting stock problem. A deterministic mathematical model, that considers multiple dimensions of integration and comprises several aspects found in practice, is proposed. This model is used as a framework to classify the current literature in this field. The main classification of the literature is organized around two types of integration. In a planning horizon which consists of multiple periods, the inventory provides a link between the periods. This integration across time periods constitutes the first type of integration. The proposed model also considers the production of different types of items at three different levels: objects are fabricated or purchased and next cut into pieces which are then assembled into final products. The integration between these three production levels constitutes the second type of integration. The classification indicates that, even though many papers in the current literature analyze an integrated lot-sizing and cutting stock problem, they vary widely with respect to the level of integration on the time and production level dimensions. Furthermore, our analysis indicates that the current models also consider varying assumptions with respect to the inventory, the production capacities and the setups. Finally, we point out some possible interesting areas for future research. (R. Jans). that might correspond to customer requests, and a decision related to the cutting stock problem is needed. Part of the smaller reels can be cut again into paper sheets, according to some decision related to the lot size for the papers sheets. In the furniture industry, wooden plates are produced or purchased from different suppliers, and a decision about the size of the lots to be produced or purchased from each supplier must be taken. Then, these wooden plates are cut into several wooden parts (in a two-dimensional cutting stock process) to be assembled into the final products. A decision about the size of the lots of final products is also needed, and consequently there are three levels of decisions. Other examples can be found in the fiberglass industry, where fiberglass plates are cut to manufacture printed circuit boards and in the aluminium industry, where aluminium profiles are cut to make several window types. The basic idea of the integrated lot-sizing and cutting stock problem is to consider, simultaneously, the decisions related to both problems so as to capture the interdependency between these decisions in order to obtain a better global solution. Several papers from the literature present computational results showing the benefits of considering an integrated approach instead of taking decisions separately

show abstract

On cutting stock with due dates

Cited by 48 publications

References 28 publications

Just-in-time batch scheduling problem with two-dimensional bin packing constraints

Just-in-time batch scheduling problem with two-dimensional bin packing constraints

Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem

Classification and literature review of integrated lot-sizing and cutting stock problems

Contact Info

Product

Resources

About