Abstract
In a paper published in 1987, an exchange heuristic for developing efficient makespans for resource constrained scheduling problems was presented. It has since been successfully applied to other types of scheduling problems including generalized job shop scheduling and project scheduling with limited resources. The increased flexibility of the heuristic is becoming reaped. As such, several modifications of the exchange heuristic to increase the performance of developing efficient makespans are now presented. Empirical results of implementing these extended heuristics to problems in general job shop scheduling and their comparison to the original heuristic are also presented. Results show that the extended heuristics produce better makespan schedules on average than the original heuristic though there is a price of increased computational time
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.
