Login / Signup

Efficient parallel B&B method for the blocking job shop scheduling problem.

Adel DabahAhcène BendjoudiAbdelhakim AitZai
Published in: HPCS (2016)
Keyphrases
  • special case
  • job shop scheduling problem
  • computational complexity
  • probabilistic model
  • similarity measure
  • np hard
  • optimization algorithm
  • tree structure
  • critical path