A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective

In this paper we consider the job shop scheduling problem with total weighted tardiness objective (JSPTWT). This objective reflects the goal to achieve a high service level which is of increasing importance in many branches of industry. The paper concentrates on a class of baseline heuristics for this problem, known as neighborhood search techniques. An approach based on disjunctive graphs is developed to capture the general structure of neighborhoods for the JSPTWT. Existing as well as newly designed neighborhoods are formulated and analyzed. The performance and search ability of the operators (as well as combinations thereof) are compared in a computational study. Although no dominant operator is identified, a transpose-based perturbation on multiple machines turns out as a promising choice if applied as the only operator. Combining operators improves the schedule quality only slightly. But, the implementation of operators within a meta-heuristic enables to produce a higher schedule quality. A structural classification of neighborhood operators and some new analytical results are presented as well. HighlightsIn the paper, we formulate a generic approach for modeling the job shop scheduling problem with total weighted tardiness objective.We introduce six new neighborhoods derived from different kinds of perturbation schemes.The paper provides new result regarding the feasibility gurantee and connectivity property of the neighborhoods.The search quality of the neighborhoods is assessed in a comprehensive computational study.