Multimodularity in the Stochastic Appointment Scheduling Problem with Discrete Arrival Epochs.
Christos ZachariasTallys YunesPublished in: Manag. Sci. (2020)
Keyphrases
- scheduling problem
- single machine
- flowshop
- tabu search
- np hard
- monte carlo
- permutation flowshop
- setup times
- markov processes
- continuous domains
- total tardiness
- minimizing makespan
- discrete version
- parallel machines
- precedence constraints
- stochastic optimization
- learning automata
- steady state
- dynamic programming
- hopfield neural network
- optimal solution
- stochastic models
- discrete variables
- service systems
- discrete geometry
- maximum lateness
- upper bound
- arrival times
- computational complexity