In this paper it is shown, through computational results, that a schedule generation algorithm originally designed for the traditional job shop model can still provide good results, in terms of CPU ...

The paper is devoted to some single machine scheduling problems, where job processing times are defined by functions dependent on their positions in the sequence. It is assumed that each job is ...