The distributed permutation flow shop to minimise the total flowtime.
Victor Fernandez-ViagasPaz Perez-GonzalezJose M. FramiñanPublished in: Comput. Ind. Eng. (2018)
Keyphrases
- flowshop
- total flowtime
- scheduling problem
- flowshop scheduling problems
- permutation flowshop
- minimizing makespan
- flowshop scheduling
- special case
- processing times
- distributed systems
- tabu search
- upper bound
- setup times
- sequence dependent setup times
- asymptotic optimality
- single machine
- job shop
- np hard
- parallel machines
- open shop
- release dates
- simulated annealing
- linear programming
- lot streaming
- computational complexity