Computer-assisted mathematical programming (modelling) systems: CAMPS
The Computer Journal
Job shop scheduling by simulated annealing
Operations Research
Applying tabu search to the job-shop scheduling problem
Annals of Operations Research - Special issue on Tabu search
A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation
Computers and Industrial Engineering
A fast taboo search algorithm for the job shop problem
Management Science
Decision Support with Web-Enabled Software
Interfaces
Optimization as an Internet Resource
Interfaces
Principled design of the modern Web architecture
ACM Transactions on Internet Technology (TOIT)
IEEE Computational Science & Engineering
E-service: a new paradigm for business in the electronic environment
Communications of the ACM - E-services: a cornucopia of digital offerings ushers in the next Net-based evolution
Performance of Various Computers Using Standard Linear Equations Software
Performance of Various Computers Using Standard Linear Equations Software
The evolution of web-based optimisation: From ASP to e-Services
Decision Support Systems
An efficient memetic algorithm for solving the job shop scheduling problem
Computers and Industrial Engineering
CORBA: integrating diverse applications within distributed heterogeneous environments
IEEE Communications Magazine
| Hi-index | 12.05 |
The Job-Shop Scheduling Problem (JSSP) is well known for its complexity as an NP-hard disjunctive scheduling problem. The problem addressed in this paper is JSSPs with an objective of minimizing makespan while satisfying a number of hard constraints. An efficient GRASPxELS approach is introduced for solving this problem. The efficiency is evaluated using the widely known 40 Laurence's instances which encompass medium and large scale instances. The computational results prove that the proposed method competes with the best published methods in both quality of results and computational time. Recently, Web services have generated great interest in researchers. Such application architecture is based on the client-server model using existing Internet protocols and open standards. It provides new approaches to optimization methods. The proposed GRASPxELS is packaged into a Web Service (WS), i.e., it offers for the research community an open access to our optimization approach. Moreover, the proposed web service can be even included in research future works with a very small programming effort. To favor utilization of the web service and to prove the facility in which the service could be used, we provide an example in Java proving that it is possible to obtain in less than 10min a client application using the different methods exposed by this web service. Such usage extends to classical library inclusion in program with the difference that a method is called in the client side and represents an execution on the server. The Web Service paradigm is a new approach in spreading algorithms and therefore this paper stands at the crossroads of optimization research community and the web service community expectations. The GRASPxELS provided in the web service, is a state of the art method which competes with previously published ones and which has the advantage of being available for free, in any languages, everywhere contributing in spreading operational research contribution.