Abstract
This paper deals with glass cutting in an Italian plant producing parts for the automotive market. Glass cutting is basically organised in two phases: first, large rectangular sheets of the same type are obtained from a ribbon of flat glass and sent to warehouse; then, sheets of various types are taken from the warehouse and cut into small rectangular parts of various sizes according to demand. In both phases, trim loss is generated. A problem then arises of fulfilling the demand of small parts using a limited assortment of large sheets and minimizing the total trim loss. In this paper we describe a heuristic algorithm based on a p-median model with additional constraints that take into account all the relevant shop floor requirements. A computational study conducted on real instances provided by the plant is presented and discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
