Abstract
This paper discusses the more recent literature on job-shop-like sequencing problems.
The types of problems can be broadly classified as "due date" or "minimum make-span" and among the solutions described particular stress is laid on the increasing adoption of heuristic devices.
Some consideration is given to the possible limitations of highly idealized models and the paucity of papers on applications.
Paper presented at the Operational Research Society National Conference, Shrivenham, 1965.
Paper presented at the Operational Research Society National Conference, Shrivenham, 1965.