Login / Signup

Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products.

Ruy Luiz MilidiúArtur Alves PessoaEduardo Sany Laber
Published in: APPROX (2002)
Keyphrases
  • makespan minimization
  • job shop scheduling problem
  • processing times
  • special case
  • scheduling problem
  • flowshop
  • cost function
  • worst case
  • computational complexity
  • metaheuristic
  • polynomially solvable