LiSA is a software-package for entering, editing and solving arbitrary deterministic scheduling problems, but the main focus is on shop-scheduling and one-machine problems. LiSA can be used to determine the complexity, to display and manipulate solutions and to develop algorithms for a given problem.
Efficient data-structures to treat scheduling problems, the corresponding input data and solutions.
The data-structures from the core are also available for use in the external algorithms.
XML-based file-format to store scheduling problems and solutions. This is also used to communicate with the algorithms.
Automatical selection of algorithms that can solve the current problem type.
All algorithms can be invoked from command line, too, independenty from the GUI.
Graphical user interface
Written in Tcl/Tk for machine and operating system indepedence.
User Interface language either English or German.
Enter a problem type in the usual alpha | beta | gamma notation.
Determination of the complexity of a scheduling problem, including full literature references.
Enter processing times and other data as matrices and vectors.
Enter a sequence as latin rectangle.
Display a solution as Gantt chart (both job-oriented and machine-oriented) or as sequence graph.
Highlight the critical path in all solution displays.
Edit a solution manually by shifting operations in the job order or machine order.
Determination of the complexity of arbitrary scheduling problems. This is done by using a problem reduction and Brucker's database.
LiSA comes with a bunch of already implemented algorithms, both exact and heuristic.
Easy-to-use framework to add your own algorithms (experience in C++ needed).