Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling

This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduling. We use iterated local search to obtain (i) sharpened upper bounds, (ii) an improved branchordering heuristic, and (iii) and improved variableselection heuristic. On randomly-generated instances, our hybrid of iterated local search and branch and bound outperforms either algorithm in isolation by more than an order of magnitude, where performance is measured by the median amount of time required to find a globally optimal schedule. We also demonstrate performance gains on benchmark instances from the OR library.

• Type: Conference
• Year: 2006
• Where: AIPS
• Authors: Matthew J. Streeter, Stephen F. Smith
• Keywords: AIPS 2006, Artificial Intelligence, Iterated Local Search, Job Shop Scheduling, Local Search Algorithm