Mean flow time minimization with given bounds of processing times.
Tsung-Chyan LaiYuri N. SotskovNadezhda SotskovaFrank WernerPublished in: Eur. J. Oper. Res. (2004)
Keyphrases
- processing times
- scheduling problem
- single machine
- upper bound
- scheduling jobs
- lower bound
- setup times
- release dates
- objective function
- worst case performance ratio
- single machine scheduling problem
- communication delays
- resource consumption
- worst case
- polynomially solvable
- earliness tardiness
- flowshop
- precedence relations
- neural network
- lower and upper bounds
- average case
- error bounds
- assembly line
- tabu search
- identical machines
- release times