In this project, you will construct schedules for a variety of classic job shop benchmark problems. A README explains the format and source of these benchmarks. Download one of jobshop.zip, jobshop.tar.Z, or individual files from the problem directory, and have at 'em!
The objective function for these is to minimize ``makespan'' (ending time for last job). Some details of one author's approach to a bunch of them are given in a paper on the ``Localizer'' local-search language (including some results).