Login / Signup

An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times.

Zhi-Hai ZhangDanyu Bai
Published in: Appl. Math. Comput. (2014)
Keyphrases
  • completion times
  • weighted sum
  • genetic algorithm
  • objective function
  • computational complexity
  • scheduling problem
  • single machine