A Biased-Randomized Discrete-Event Heuristic for the Hybrid Flow Shop Problem with Batching and Multiple Paths.
Christoph LaroqueMadlene LeißauPedro CopadoJavier PanaderoAngel A. JuanChristin SchumacherPublished in: WSC (2021)
Keyphrases
- discrete event
- flowshop
- multiple paths
- scheduling problem
- tabu search
- asymptotic optimality
- dynamic systems
- simulation model
- unrelated parallel machines
- strongly np hard
- multipath
- setup times
- processing times
- single machine
- special case
- scheduling jobs
- job shop scheduling problem
- dynamical systems
- parallel machines
- simulated annealing
- precedence constraints
- metaheuristic
- np hard
- search algorithm
- multiple description coding
- optimal solution
- release dates
- routing algorithm
- high speed
- dynamic programming