Abstract
In this paper a two-stage loading problem, dealing with allocation of jobs to machines, is studied. The outer problem is to choose a subset among a number of available machines such that a feasible assigment exists and the total cost price is minimized. The inner problem, is then to find the optimal allocation, given the subset of machines and some assigment criterion at this lower level. It is shown that the choice of problem formulation can be crucial for the strength of the continuous relaxation. Computational results are also presented
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.
