Abstract
In this paper we propose a decomposition approach that hierarchically integrates the batching and local search heuristics in manufacturing scheduling. The problem comprises two main interrelated stages embedded in any production-transportation supply chain, namely (i) scheduling processing of raw materials and robot's transportation operation within each individual cell, and (ii) scheduling of transportation and distribution of batches of semi-finished products between cells. Several efficient heuristic algorithms are proposed. This work has been motivated by a real-life problem of production planning for a CIM system for manufacturing of multi-component products served by robots.
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.
