• Open Access IconOpen Access
  • Cite Icon146
  • https://doi.org/10.1007/s10601-008-9061-0Copy DOI Icon

Compiling finite linear CSP into SAT

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In this paper, we propose a new method to encode Constraint Satisfaction Problems (CSP) and Constraint Optimization Problems (COP) with integer linear constraints into Boolean Satisfiability Testing Problems (SAT). The encoding method (named order encoding) is basically the same as the one used to encode Job-Shop Scheduling Problems by Crawford and Baker. Comparison x???a is encoded by a different Boolean variable for each integer variable x and integer value a. To evaluate the effectiveness of this approach, we applied the method to the Open-Shop Scheduling Problems (OSS). All 192 instances in three OSS benchmark sets are examined, and our program found and proved the optimal results for all instances including three previously undecided problems.

Similar Papers
  • Book Chapter
  • Citations44

Compiling Finite Linear CSP into SAT

  • Jan 01, 2006
  • Naoyuki Tamura +3
  • Research Article
  • Citations11

An Iterative local-search framework for solving constraint satisfaction problem

  • Jan 05, 2008
  • Applied Soft Computing Journal
  • Mohamed Tounsi +1
  • Research Article
  • Citations26

Coordination of multiple agents for production management

  • Jan 01, 1997
  • Annals of Operations Research
  • Jyi-Shane Liu +1
  • Research Article
  • Citations41

A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times

  • Feb 15, 2020
  • European Journal of Operational Research
  • Gonzalo Mejía +1
  • Research Article
  • Citations19

Genetic reinforcement learning approach to the heterogeneous machine scheduling problem

  • Jan 01, 1998
  • IEEE Transactions on Robotics and Automation
  • Gyoung Hwan Kim +1
  • PDF
  • Research Article
  • Citations10

A Heuristic Rule Based on Complex Network for Open Shop Scheduling Problem With Sequence-Dependent Setup Times and Delivery Times

  • Jan 01, 2019
  • IEEE Access
  • Zilong Zhuang +3
  • Research Article
  • Citations2

Weight-based Heuristics for Constraint Satisfaction and Combinatorial Optimization Problems

  • Feb 16, 2012
  • Journal of Mathematical Modelling and Algorithms
  • Marie-José Huguet +2
  • Research Article
  • Citations16

On the geometry, preemptions and complexity of multiprocessor and shop scheduling

  • Dec 01, 2007
  • Annals of Operations Research
  • Evgeny V Shchepin +1
  • Book Chapter
  • Citations25

The progressive party problem: Integer linear programming and constraint programming compared

  • Jan 01, 1995
  • Barbara M Smith +3
  • Research Article
  • Citations6

A new two-stage constraint programming approach for open shop scheduling problem with machine blocking

  • Dec 15, 2022
  • International Journal of Production Research
  • Levi R Abreu +2
  • Conference Article
  • Citations20

Genetic reinforcement learning approach to the machine scheduling problem

  • May 21, 1995
  • G.H Kim +1
  • Conference Article
  • Citations8

Optimizing Constraint Solving via Dynamic Programming

  • Aug 01, 2019
  • Shu Lin +2
  • Research Article
  • Citations3

A bi-objective MILP model for an open-shop scheduling problem with reverse flows and sequence-dependent setup times

  • Jan 01, 2024
  • European J. of Industrial Engineering
  • Saba Aghighi +3
  • Research Article
  • Citations403

Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems

  • Nov 01, 2001
  • INFORMS Journal on Computing
  • Vipul Jain +1
  • Research Article
  • Citations50

Integer Linear Programming and Constraint Programming Approaches to a Template Design Problem

  • Aug 01, 1998
  • INFORMS Journal on Computing
  • Les Proll +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.