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

Soler, Willy A. O. and Santos, Maristela O. and Akartunali, Kerem (2019) MIP approaches for a lot sizing and scheduling problem on multiple production lines with scarce resources, temporary workstations, and perishable products. Journal of the Operational Research Society. ISSN 0160-5682

[img] Text (Soler-etal-JORS-2019-MIP-approaches-for-a-lot-sizing-and-scheduling-problem-on-multiple-production-lines)
Soler_etal_JORS_2019_MIP_approaches_for_a_lot_sizing_and_scheduling_problem_on_multiple_production_lines.pdf
Accepted Author Manuscript
Restricted to Repository staff only until 1 July 2020.

Download (1MB) | Request a copy from the Strathclyde author

    Abstract

    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.