A HEURISTIC FOR SCHEDULING GENERAL JOB SHOPS TO MINIMIZE MAXIMUM LATENESS

Based on the various priority dispatching rules, three dominant rules were formulated. Heuristic approaches were developed based on these do minant rules and dominant matrix. These heuristics can solve problems where a job may need to be processed by the same machine more than onc e in its operation sequence and different release times are allowed fo r different machines. The proposed heuristics appear to be fairly effe ctive procedures, and various numerical results are obtained and compa red with the various dispatching rules and with a branch and bound app roach.