A Dual Criteria Preemptive Scheduling Problem For Minimax Error Of Imprecise Computation Tasks.
Kevin I.-J. HoJoseph Y.-T. LeungPublished in: Int. J. Found. Comput. Sci. (2004)
Keyphrases
- scheduling problem
- single machine
- np hard
- setup times
- flowshop
- processing times
- tabu search
- neyman pearson
- permutation flowshop
- multi criteria
- worst case
- error rate
- total tardiness
- sequence dependent setup times
- maximum lateness
- parallel machines
- learning algorithm
- minimizing makespan
- release dates
- primal dual
- evaluation function
- error bounds
- monte carlo
- search algorithm