A HEURISTIC APPROACH TO ALTERNATE ROUTING IN A JOB SHOP.
Abstract
The research reported investigates the use of heuristics for selecting from several alternate routes, resulting from partially-ordered tasks in a job-shop order file. The experimental vehicle employed was digital simulation on the Project MAC Compatible Time-Sharing System. The methodology was to conduct two passes of simulated shop runs. The first, with two artificially high levels of alternate incidence, tested the efficiency of five different alternate routing heuristics in reducing mean tardiness. The second pass consisted of runs with the best heuristic developed during the first experimental phase, applied to a realistic length and frequency of alternate strings. The performance characteristics of the different heuristics are discussed at length. In addition, some implications are drawn of the computational nature of alternate routing and the difficulties encountered in implementing alternate routing heuristics at operation time. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1965
- Accession Number
- AD0474018
Entities
People
- Francis John Russo
Organizations
- Massachusetts Institute of Technology