A Heuristic Method for a Job-Scheduling Problem

A batch of jobs is to be processed on a certain production line. Each job can be done in several states of the line but at varying production costs and there is also a cost of changing states. The batch is to be scheduled at minimum total cost. A method of breaking down the problem and using a branching process to generate sequences of states is given. It takes advantage of special features of the cost structure.