Login / Signup

The complexity of makespan minimization for pipeline transportation.

Ruy Luiz MilidiúArtur Alves PessoaEduardo Sany Laber
Published in: Theor. Comput. Sci. (2003)
Keyphrases
  • makespan minimization
  • processing times
  • scheduling problem
  • job shop scheduling problem
  • metaheuristic
  • np complete
  • single machine
  • polynomially solvable
  • computational complexity
  • special case
  • setup times