Abstract: Finding a policy for stochastic scheduling problems on parallel machines is a complicated task, as the problem is already NP-hard in the deterministic case. The problem becomes even more ...
Abstract: FSSP (Flow Shop Scheduling Problem) as its origin in 1950’s. In FSSP they are mainly related to important objectives such as makespan and total completion time (TCT) of flow lines. Johnson ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results