Login / Signup

A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows.

Antonio Sedeño-NodaDavid Alcaide López de PabloCarlos González-Martín
Published in: Eur. J. Oper. Res. (2009)
Keyphrases
  • scheduling problem
  • network flow
  • open shop
  • np hard
  • minimum cost
  • job shop
  • objective function
  • multi objective
  • cost function
  • lower bound
  • evolutionary algorithm
  • dynamic programming
  • approximation algorithms