A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots.
Atabak ElmiSeyda TopalogluPublished in: Comput. Oper. Res. (2013)
Keyphrases
- multiple robots
- scheduling problem
- flowshop
- path planning
- mobile robot
- autonomous robots
- multi robot
- collision avoidance
- processing times
- single machine
- ant colony
- setup times
- special case
- minimizing makespan
- software agents
- precedence constraints
- flowshop scheduling
- tabu search
- multiple targets
- sequence dependent setup times
- manufacturing cell
- np hard
- permutation flowshop
- maximum lateness
- job shop
- parallel machines
- total tardiness
- release dates
- unrelated parallel machines
- job shop scheduling problem
- strongly np hard
- dynamic environments
- multi agent systems
- robot navigation
- neural network
- ant colony algorithm
- global optimization
- multistage