This work evaluates the use of a filtered beam search (FBS) combined with an ociosity insertion algorithm (OIA). The case studied is based on a single machine, with multiple due dates, and distinct earliness and tardiness penalties for each job. The objective function is to minimize total cost. For this, the FBS is used to construct sequences, and the OIA is used to obtain schedules. It is assumed that the degree of difficulty of solving the problem is dependent on two parameters: average tardiness factor and relative range of due dates. Comparative empirical tests were conducted with computational simulation, where computational solution time and the objective function value were evaluated. The results indicate that in general, the proposed procedure favours a decrease in total cost and, in addition, that before choosing an appropriate procedure, the ideal situation is to know the value of the parameters.
single machine scheduling; ociosity insertion; filtered beam search; just-in-time
