Login / Signup

A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems.

Daniel Alejandro RossitÓscar C. VásquezFernando TohméMariano FrutosMartín D. Safe
Published in: Eur. J. Oper. Res. (2021)
Keyphrases
  • scheduling problem
  • flowshop
  • processing times
  • squeaky wheel
  • np hard
  • single machine
  • setup times
  • special case
  • total weighted tardiness
  • flowshop scheduling
  • evolutionary algorithm
  • multistage
  • steady state