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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Papadimitriou, C.H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity, p. 496. Dover Publications, Mineola (1998)
Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of Flow shop and Job shop Scheduling. Mathematics of Operations Research 1(2), 117–129 (1976)
Brucker, P.B.: Scheduling algorithms, 5th edn., p. 371. Springer, Heidelberg (2007)
Balas, E.: Machine Sequencing via Disjunctive Graphs. An Implicit Enumeration Algorithm, Operations Research 17, 941–957 (1969)
Conway, R.W., Maxwell, W.L., Miller, L.W.: Theory of Scheduling. Addison Wesley, Massachusetts (1967)
Jalilvand, A., Khanmohammadi, S., Shabaninia, F.: Scheduling of sequence-dependant jobs on parallel multiprocessor systems using a branch and bound-based Petri net, Emerging Technologies. In: Proc of the IEEE, pp. 334–339 (September 17-18, 2005) ISBN: 0-7803-9247-7
Cruz-Chávez, M.A., Frausto-Solís, J., Zavala-Díaz, J.C., Sanvicente-Sánchez, H., Cruz-Rosales, M.H.: A Simulated Annealing Algorithm with Cooperative Processes for Scheduling Problems. ISSADS 2006, LNCS. Springer, Heidelberg ISSN: 0302-9743 (to appear)
Zalzala, P.J., Flemming.: Genetic algorithms in engineering systems, in A.M.S. Inst. of Electrical Engineers (1997)
Defu, Z., Tangqiu, Li., Shaozi, Li.: An improved shifting bottleneck algorithm for job shop scheduling problem. In: Proceedings of the Ninth International Conference on Computer Supported Cooperative Work in Design. vol. 2, pp. 1112–1116, 24-26 (May 2005)
Schutten, M.J.: Practical job shop scheduling. In Annals of Operations Research 83, 161–177 (1988)
El-Mihoub, T.A., Hopgood, A.A., Nolle, L., Battersby, A.: Hybrid Genetic Algorithms: A Review, Engineering Letters (2006) ISSN: 1816-0948, 13:2, EL_13_2_11
Shannon Land, M.W.: Evolutionary Algorithms with Local Search for Combinatorial Optimization, Ph.D. Thesis, University of California, San Diego, p. 169 (1998)
Krasnogor, N., Smith, J.: A Memetic Algorithm With Self-adaptive Local Search: TSP as a case study. In: Whitley, Goldberg, Cantu-Paz, Spector, Parmee, Beyer (eds.) Proceedings of GECCO 2000, pp. 987–994. Morgan Kaufmann, San Francisco (2000)
Cruz-Chávez, M.A., Frausto-Solís, J.: Simulated Annealing with Restart to Job Shop Scheduling Problem Using Upper Bounds. In: Rutkowski, L., Siekmann, J.H., Tadeusiewicz, R., Zadeh, L.A. (eds.) ICAISC 2004. LNCS (LNAI), vol. 3070, pp. 860–865. Springer, Heidelberg (2004)
Ullman, J.D.: NP-complete scheduling problems. Journal of Computer System Sciences 10, 384–393 (1975)
Crawford, J.M., Baker, A.B.: Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems. In: Proc. of the 12th National Conf. on Artificial Intelligence, Austin, TX, pp. 1092–1098 (1994)
Memik, S.O., Fallah, F.: Accelerated SAT-based scheduling of control/data flow graphs Computer Design: VLSI in Computers and Processors, pp. 395–400, Proc IEEE (September 16-18, 2002)
Frausto-Solís, J., Cruz-Chávez, M.A.: A Reduced Codification for the Logical Representation of Job Shop Scheduling Problems. In: Laganà, A., Gavrilova, M., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol. 3046, pp. 553–562. Springer, Heidelberg (2004)
Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness, p. 340. W.H. Freeman and Company, New York (1991)
Selman, B., Kautz, II, A.: Local search strategies for satisfiability testing. In: Procceding DIMACS Workshop on Maximum Clique, Graph Coloring and Satisfiability (1993)
Hoos, H.H., Stützle, T., SATLIB,: An Online Resource for Research on SAT. In: Gent, I.P., Maaren, H.v., Walsh, T. (eds.) SAT, pp. 283–292. IOS Press, Amsterdam (2000), SATLIB is available online at www.satlib.org
Beasley, J.E.: OR Library, Imperial College, Management School, Last Update (October 2005) (2007), http://people.brunel.ac.uk/~mastjjb/jeb/info.html
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cruz-Chávez, M.A., Rivera-López, R. (2007). A Local Search Algorithm for a SAT Representation of Scheduling Problems. In: Gervasi, O., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2007. ICCSA 2007. Lecture Notes in Computer Science, vol 4707. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74484-9_60
Download citation
DOI: https://doi.org/10.1007/978-3-540-74484-9_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74482-5
Online ISBN: 978-3-540-74484-9
eBook Packages: Computer ScienceComputer Science (R0)