Login / Signup

A hybrid approach to the single line scheduling problem with multiple products and sequence-dependent time.

Roberto SpinaLuigi Maria GalantucciMichele Dassisti
Published in: Comput. Ind. Eng. (2003)
Keyphrases
  • scheduling problem
  • single machine
  • np hard
  • search algorithm
  • database
  • genetic algorithm
  • case study
  • dynamic programming
  • input data
  • flowshop
  • parallel machines
  • multiple targets
  • multiple independent