A Web-Lab Environment for the Study of the Job Shop Problem

Article Preview

Abstract:

This work proposes a Web-Based laboratory where researchers share the facilities of a simulation environment for parallel algorithms which solves scheduling problems known as Job Shop Problem (JSP). The environment supports multi-language platforms and uses a low cost, high performance Graphics Processing Unit (GPU) connected to a Java application server to help design more efficient solutions for JSP. Within a single web environment one can analyze and compare different methods and meta-heuristics. Each newly developed method is stored in an environment library and made available to all other users of the environment. This amassment of openly accessible solution methods will allow for the rapid convergence towards optimal solutions for JSP. The algorithm uses the parallel architecture of the system to handle threads. Each thread represents a job operation and the number of threads scales with the problem’s size. The threads exchange information in order to find the best solution. This cooperation decreases response times by one or two orders of magnitude.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 463-464)

Pages:

1073-1076

Citation:

Online since:

February 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] D. Kanter; 2008. NVIDIA's GT200: inside a parallel processor" (online), Available from http: /www. realworldtech. com/page. cfm, ArticleID=RWT090808195242&p=1 (acessed July 2010).

Google Scholar

[2] P.J. M van Laarhoven et al., Job Shop Scheduling by simulated annealing, Operations Research, vol. 40, No. 1, pp.113-125, Jan. - Feb., 1992. (article consists of 13 pages Published by: INFORMS. Stable URL: http: /www. jstor. org/stable/171189).

DOI: 10.1287/opre.40.1.113

Google Scholar

[3] E. D. Taillard, Parallel Tabu search techniques for the Job Shop scheduling problem, ORSA Journal on Computing, vol. 6, No. 2, p.108–116, Spring (1994).

DOI: 10.1287/ijoc.6.2.108

Google Scholar

[4] F. Glover and M. Laguna, Tabu Search, Kluwer Academic Publishers, 1997, ISBN 0-7923-9965-X.

DOI: 10.1080/07408179808966535

Google Scholar

[5] J. Beasley; 1990. OR-Library, (online). Available from http: /people. brunel. ac. uk/~mastjjb/jeb/info. html (accessed 30 July 2010).

Google Scholar

[6] T. R. Halfhill, 2008. Parallel processing with CUDA, Microprocessor Report, (online), Available from: http: /www. nvidia. com/docs/IO/55972/220401_Reprint. pdf. (Acessed July 2010).

Google Scholar