A biased-randomized simheuristic for the distributed assembly permutation flowshop problem with stochastic processing times.
Eliana María González-NeiraDaniele FeroneSara HatamiAngel A. JuanPublished in: Simul. Model. Pract. Theory (2017)
Keyphrases
- processing times
- scheduling problem
- permutation flowshop
- single machine
- assembly line
- flowshop
- np hard
- setup times
- strongly np hard
- single machine scheduling problem
- tabu search
- precedence constraints
- release dates
- worst case performance ratio
- minimizing makespan
- parallel machines
- competitive ratio
- sequence dependent setup times
- upper bound
- manufacturing cell
- search algorithm
- completion times
- message passing
- greedy algorithm
- identical machines