Non-indexability of the stochastic appointment scheduling problem.
Mehdi Jafarnia-JahromiRahul JainPublished in: Autom. (2020)
Keyphrases
- scheduling problem
- single machine
- tabu search
- flowshop
- np hard
- setup times
- learning automata
- permutation flowshop
- parallel machines
- precedence constraints
- stochastic optimization
- minimizing makespan
- total tardiness
- neural network
- processing times
- monte carlo
- earliness tardiness
- stochastic models
- approximation algorithms
- stochastic nature
- unrelated parallel machines
- list scheduling