Abstract
Classical job shop scheduling problems took many forms over decades out of which the prominent one is flexible job shop scheduling problem (FJSP), where any machine from a given set, rather than one specific machine can process each operation. To form a stronger search mechanism and better scheduling, an integrated search heuristic given as integrated HHS–ALNS, where the local search in hybrid harmony search (HHS) is replaced by adaptive large neighborhood search (ALNS), is proposed for the FJSP. In ALNS, a weight associated with every operation is adjusted during the end of search segments based on its previous behaviors and violation of capacity constraints. By using this proposed method, the performance is improved a lot in terms of makespan.
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 call
