An algorithm for minimizing flow time and maximum earliness on a single machine.
R.-H. HuangC.-L. YangPublished in: J. Oper. Res. Soc. (2009)
Keyphrases
- single machine
- scheduling problem
- competitive ratio
- total weighted tardiness
- single machine scheduling problem
- dynamic programming
- np hard
- processing times
- weighted number of tardy jobs
- optimal solution
- linear programming
- convergence rate
- worst case
- search space
- learning algorithm
- release dates
- sequence dependent setup times
- computational complexity
- scheduling jobs
- release times
- benchmark problems
- solution quality
- learning effect