Iterative-Sampling Search for Job Shop Scheduling with Setup Times

September 2009

Iterative-Sampling Search for Job Shop Scheduling with Setup Times

Authors:

A. Oddi, R. Rasconi, A. Cesta, and S. F. Smith

Abstract:

This paper presents a heuristic algorithm for solving the job-shop scheduling problem with sequence dependent setup times (SDST-JSSP). The algorithm relies on a core constraint-based search procedure, which generates consis-tent ordering of activities requiring the same resource by in-crementally imposing precedence constraints on a temporal feasible solution. Key to the effectiveness of the search pro-cedure is a conflict sampling method biased toward selection of most critical conflict and coupled with a non-deterministic choice heuristic to guide the base conflict resolution process. This constraint-based search is then embedded within a larger iterative-sampling search framework to broaden search space coverage and promote solution optimization. The efficacy of the overall heuristic algorithm is demonstrated empirically on a set of previously studied job-shop scheduling benchmark problems with sequence dependent setup times.
@workshop{Oddi-2009-120520,
author = {A. Oddi And R. Rasconi And A. Cesta And S. F. Smith},
title = {Iterative-Sampling Search for Job Shop Scheduling with Setup Times},
booktitle = {Proceedings of ICAPS '09 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS '09)},
year = {2009},
month = {September},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.