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

MIP approaches for a lot sizing and scheduling problem on multiple production lines with scarce resources, temporary workstations, and perishable products

Full text
Soler, Willy A. O. [1] ; Santos, Maristela O. [2] ; Akartunali, Kerem [3]
Total Authors: 3
[1] Univ Fed Mato Grosso do Sul, Math Inst, Campo Grande - Brazil
[2] Univ Sao Paulo, Inst Math & Comp Sci, Dept Appl Math & Stat, Sao Carlos, SP - Brazil
[3] Univ Strathclyde, Dept Management Sci, Glasgow, Lanark - Scotland
Total Affiliations: 3
Document type: Journal article
Source: Journal of the Operational Research Society; AUG 2019.
Web of Science Citations: 0

This paper addresses a lot sizing and scheduling problem inspired from a real-world production environment apparent in food industry. Due to the scarcity of resources, only a subset of production lines can operate simultaneously, and those lines need to be assembled in each production period. In addition, the products are perishable, and there are often significant sequence-dependent setup times and costs. We first propose a standard mixed integer programming model for the problem, and then a reformulation of the standard model in order to allow us to define a branching rule to accelerate the performance of the branch-and-bound algorithm. We also propose an efficient relax-and-fix procedure that can provide high-quality feasible solutions and competitive dual bounds for the problem. Computational experiments indicate that our approaches provide superior results when benchmarked with a commercial solver and an established relax-and-fix heuristic from the literature. (AU)

FAPESP's process: 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry
Grantee:José Alberto Cuminato
Support type: Research Grants - Research, Innovation and Dissemination Centers - RIDC