On the dominance of permutation schedules for some ordered and proportionate flow shop problems.

S. S. Panwalkar Christos Koulamas

Published in: Comput. Ind. Eng. (2017)

Keyphrases

scheduling problem
flowshop
flowshop scheduling problems
np hard
flowshop scheduling
optimization problems
genetic algorithm
special case
steady state
combinatorial optimization
single machine
processing times
job shop scheduling problem
precedence constraints
job shop scheduling
open shop