A local search algorithm for a SAT representation of scheduling problems

被引：0

作者：

Antonio Cruz-Chavez, Marco ^{[1
]}

Rivera-Lopez, Rafael ^{[2
]}

机构：

[1] Autonomous Univ Morelos State, CIICAp, Av Univ 1001, Cuernavaca 62209, Morelos, Mexico

[2] Technol Inst Veracruz, Mexico City 91860, DF, Mexico

来源：

COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2007, PT 3, PROCEEDINGS | 2007年 / 4707卷

关键词：

job shop; satisfiability; SAT formula; disjunctive graph; reduced SAT codification of [!text type='JS']JS[!/text]SP;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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.

引用

页码：697 / +

页数：3

共 50 条

[1] Algorithm of personification decreasing search for SAT problems
Zhao, Tianyu
Jianghan Shiyou Xueyuan Xuebao/Journal of Jianghan Petroleum Institute, 1997, 19 (01):
[2] An improved genetic algorithm with local search for order acceptance and scheduling problems
Cheng, Chen
Yang, Zhenyu
Xing, Lining
Tan, Yuejin
PROCEEDINGS OF THE 2013 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN PRODUCTION AND LOGISTICS SYSTEMS (CIPLS), 2013, : 115 - 122
[3] Local search on SAT-encoded colouring problems
Prestwich, S
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 : 105 - 119
[4] Guided local search for solving SAT and weighted MAX-SAT problems
Mills, P
Tsang, E
JOURNAL OF AUTOMATED REASONING, 2000, 24 (1-2) : 205 - 223
[5] Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
Patrick Mills
Edward Tsang
Journal of Automated Reasoning, 2000, 24 : 205 - 223
[6] Local search in complex scheduling problems
Urlings, Thijs
Ruiz, Ruben
ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 2007, 4638 : 202 - +
[7] Genetic local search algorithm for solving job-shop scheduling problems
Hubei Automotive Industries Institute, Shiyan 442002, China
不详
Zhongguo Jixie Gongcheng, 2008, 14 (1707-1711):
[8] An algorithm for station shunting scheduling problems combining probabilistic local search and PERT
Tomii, N
Zhou, LJ
Fukumura, N
MULTIPLE APPROACHES TO INTELLIGENT SYSTEMS, PROCEEDINGS, 1999, 1611 : 788 - 797
[9] A Differential Evolution Algorithm with Local Search for Resource Investment Project Scheduling Problems
Song, Yanni
Liu, Jing
Wimmers, Martin O.
Jiang, Zhongzhou
2015 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2015, : 1725 - 1731
[10] Some heuristic analysis of local search algorithms for SAT problems
Watanabe, O
STOCHASTIC ALGORITHMS: FOUNDATIONS AND APPLICATIONS, PROCEEDINGS, 2005, 3777 : 14 - 25

← 1 2 3 4 5 →