We show that permutation schedules are always optimal for regular, symmetric measures of performance for the m-machine flow shop with precedence constraints provided that processing times are ...
This is a preview. Log in through your library . Abstract We consider n jobs to be scheduled on two parallel machines. The jobs are subject to intree precedence constraints, that is, each job, except ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback