On non-permutation solutions to some two machine flow shop scheduling problems
type: Person