Abstract: We consider the problem of minimising the makespan in an m-machine flow shop subject to release dates and delivery times which requires scheduling n jobs through m machines which are placed ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results