Advanced search
Start date
Betweenand
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem

Full text
Author(s):
Oliveira, Washington A. [1] ; Fiorotto, Diego J. [1] ; Song, Xiang [2] ; Jones, Dylan F. [2]
Total Authors: 4
Affiliation:
[1] Univ Estadual Campinas, Sch Appl Sci, R Pedro Zaccaria 1300, BR-13484350 Limeira, SP - Brazil
[2] Univ Portsmouth, Ctr Operat Res & Logist, Sch Math & Phys, Lion Gate Bldg, Lion Terrace, Portsmouth PO1 3HF, Hants - England
Total Affiliations: 2
Document type: Journal article
Source: European Journal of Operational Research; v. 295, n. 3, p. 996-1007, DEC 16 2021.
Web of Science Citations: 0
Abstract

Lot sizing and cutting stock problems generally arise in manufacturing as a two stage connected process. Although these two problems have been addressed separately by many authors, recently, inspired by practical applications, some studies have emerged analyzing their integration. The mono-objective version of the integrated lot-sizing and cutting stock problem can be considered as an enhancement that minimizes the global production cost. However, it does not include the multiple criteria that can arise from the inclusion of multiple stakeholders in a modern, distributed manufacturing process. This paper aims to introduce a new extended goal programming model for the integrated lot-sizing and cutting stock problem which models the arising multiple criteria by a set of goals representing the interests of different stakeholders in the manufacturing process. This formulation allows for the consideration of the balance between the conflicting goals of multiple stakeholders and the cost efficiency of the overall process. In order to efficiently solve the proposed model, a column generation based heuristic procedure is applied. The trade-offs among the various criteria related to the problem are assessed, and a series of computational experiments are performed. The computational results compare individual criteria weighting schemes and evaluate the goals' sensitivity using performance profiles and time-to-target plots methodologies. (c) 2021 Elsevier B.V. All rights reserved. (AU)

FAPESP's process: 16/01860-1 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings
Grantee:Reinaldo Morabito Neto
Support Opportunities: Research Projects - Thematic Grants
FAPESP's process: 18/18754-5 - DIFFERENT SOURCES OF FLEXIBILITY APPLIED TO THE LOT SIZING PROBLEM
Grantee:Diego Jacinto Fiorotto
Support Opportunities: Regular Research Grants