A local search algorithm for a SAT representation of scheduling problems

Authors:
Marco Antonio Cruz-Chávez;Rafael Rivera-López
Affiliations:
CIICAp, Autonomous University of Morelos State, Morelos, México;Technological Institute of Veracruz, Veracruz, México
Venue:
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Year:
2007

Citing 7
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Experimental results on the application of satisfiability algorithms to scheduling problems

AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Genetic Algorithms in Engineering Systems

Genetic Algorithms in Engineering Systems
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Accelerated SAT-based Scheduling of Control/Data Flow Graphs

ICCD '02 Proceedings of the 2002 IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD'02)
Evolutionary algorithms with local search for combinatorial optimization

Evolutionary algorithms with local search for combinatorial optimization
Scheduling Algorithms

Scheduling Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the application of a local search algorithm for a logical representation of the Job Shop Scheduling Problem (JSSP). This logical representation represents the JSSP transformed as a satisfiability problem (SAT). The proposed algorithm uses a local search in a wide neighborhood. This algorithm, called Walk Wide Search - SAT, is a variant of the WalkSAT algorithm. This search is possible because the included tabu list prevents an excessive number of repetitions of movements during the search process. This paper describes the algorithm and compares results of Walk Wide Search - SAT to WalkSAT.