EGRASP for solving job shop scheduling problems with total weighted tardiness objective
This page provides the solution procedure EGRASP whch is presented in the paper "Extended GRASP for solving the Job Shop Scheduling Problem with Total Weighted Tardiness Objective" (submitted for publication). The executable files can be found in egrasp.zip. Please read first the Readme.txt within the zip folder.
Moreover, the page provides several benchmark instances known from literature as extensible markup language file (XML).
Finally, several new best solution for the benchmark set of Lawrence are found using EGRASP. These solutions are downloadable as well.
Note that the solution procedure and the instance files are based on LiSA - Library of Scheduling Algorithms. For more information, see:
http://www.math.ovgu.de/Lisa.html
If you have any questions, please contact Mr. Jens Kuhpfahl (jens.kuhpfahl-at-web.de).
If you have any questions, please contact Mr. Jens Kuhpfahl (jens.kuhpfahl-at-web.de).
Solution Procedure EGRASP
egrasp.zip
(181.2 KB) vom 27.08.2014
Benchmark Instances of the JSPTWT (la,ft,orb)
JSPTWT_benchmark_instances.zip
(178.1 KB) vom 26.08.2014
New best solutions for several la instances
JSPTWT_solutions.zip
(14.9 KB) vom 26.08.2014