سند علمی

A Mixed Integer Linear Programming model for planning at operative level in a meat packing plant

چکیده

Pork is the most widely consumed meat worldwide. In the last years, the pork industry has been faced several challenges mostly related with consumer demands about safety, quality, environment, low prices, animal welfare and sustainability of the product. Hence, the structure of the pork industry has been changing in order to adapt production to those challenges. Pig producers have been integrated with slaughterhouses, meat packing plants and other stakeholders to integrate a solid Pork supply chain, and thus, better compete in the market. Inside PSC structures several complex problems are faced by the chain manager, who is in charge of coordinating the flow through the chain. One of the most challenging problems is the one related with the production planning at operative level to process the fattening pigs into pork and by-products. The problem involves determining the production levels of each product and its inventory. Those decisions depend on how to cut up the carcasses in order to satisfy consumer demand. A mixed integer linear programming model is developed to tackle the problem. Despite others contributions that exists in the literature, our work highlights some insights derived from a sensitivity analysis developed on some parameters undergoing to large variation, such as the distribution of type of carcasses arriving to the meat packing plant.

اسناد مشابه

  • Robust mixed-integer linear programming models for the irregular strip packing problem

    سند علمی۲۰۱۶European Journal of Operational ResearchLuiz H. Cherri, Leandro Resende Mundim, Marina Andretta, Franklina Maria Bragion Toledo

    Two-dimensional irregular strip packing problems are cutting and packing problems where small pieces have to be cut from a larger object, involving a non-trivial handling of geometry. Increasingly sophisticated and complex heuristic approaches have been developed to address these

  • A mixed-integer linear programming model for the continuous casting planning

    سند علمی۲۰۱۵A. Bellabdaoui, J. Teghem

    The development of optimization models for planning and scheduling is one of the most useful tools for improving productivity of a large number of manufacturing companies. This paper presents a mixed-integer programming model for scheduling steelmaking-continuous casting producti

  • A mixed integer linear programming model applied in barge planning for Omya

    سند علمی۲۰۱۶David Bredström, Kjetil Haugen, Asmund Olstad, Jan Novotný

    This article presents a mathematical model for barge transport planning on the river Rhine, which is part of a decision support system (DSS) recently taken into use by the Swiss company Omya. The system is operated by Omya’s regional office in Cologne, Germany, responsible for di

  • A polynomial mixed-integer linear programming model for two-dimensional guillotine strip packing problem

    مقاله۲۰۲۵Journal of Mathematical ModelingAshkan Fakhri

    A two-dimensional strip packing problem is the process of packing a set of rectangular items of given dimensions into a strip of bounded width and infinite height so that the used height of the strip is minimized. In the case that only guillotine packing is permitted, the problem

  • A multiple objective mixed integer linear programming model for power generation expansion planning

    سند علمی۲۰۰۳C. Henggeler Antunes, A. Gomes Martins, Isabel Sofia Brito

    Power generation expansion planning inherently involves multiple, conflicting and incommensurate objectives. Therefore, mathematical models become more realistic if distinct evaluation aspects, such as cost and environmental concerns, are explicitly considered as objective functi

  • A new mixed-integer linear programming model for rescue path planning in uncertain adversarial environment

    سند علمی۲۰۱۲Computers & ORJean Berger, Abdeslem Boukhtouta, Abdelhamid Benmoussa, Ossama Kettani

    Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far rely on key assumptions and heuristic procedures to reduce problem complexity. In this paper, a new model is proposed