Abstract
This paper deals with a two stage method for solving large scale Hybrid Job-Shop Scheduling Problems. In this problem, a machine is able to perform several kind of tasks. This is the principal difference with the well-known Job-Shop problem, in which each task is assigned to a specialized machine. The first stage of the method solves the assignment and scheduling problems in using an insertion method. The second stage improves the quality of solutions through re-assignments and permutations of tasks, and re-insertions of jobs.
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.
