Login / Signup

Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis.

S. Thomas McCormickMichael L. Pinedo
Published in: INFORMS J. Comput. (1995)
Keyphrases
  • scheduling problem
  • flowshop
  • statistical analysis
  • information systems
  • decision trees
  • lower bound
  • real time
  • machine learning
  • computational complexity
  • special case
  • hidden markov models
  • flowshop scheduling