Two semi-online scheduling problems on two uniform machines.
C. T. NgZhiyi TanYong HeT. C. Edwin ChengPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- scheduling problem
- flowshop
- parallel machines
- online learning
- real time
- processing times
- single machine
- parallel machine scheduling problem
- artificial intelligence
- precedence constraints
- np hard
- setup times
- tabu search
- job shop scheduling problem
- online environment
- sequencing problems
- earliness tardiness
- learning machines
- dynamic programming
- special case
- search space
- learning environment
- learning algorithm