Simultaneous scheduling of jobs and transporters in a hybrid flow shop with collision-free transporter routing: A novel parallel heuristic.
Arash AmirteimooriMoataz MohamedReza KiaPublished in: Comput. Oper. Res. (2024)
Keyphrases
- unrelated parallel machines
- parallel machines
- flowshop
- scheduling problem
- identical machines
- collision free
- processing times
- strongly np hard
- tabu search
- setup times
- scheduling jobs
- asymptotic optimality
- single machine
- sequence dependent setup times
- precedence constraints
- identical parallel machines
- path planning
- shared memory
- job shop scheduling problem
- shortest path
- release dates
- maximum lateness
- minimizing makespan
- np hard
- motion planning
- permutation flowshop
- dynamic environments
- total weighted tardiness
- parallel computing
- special case
- job processing times
- collision avoidance
- manufacturing cell
- open shop
- dispatching rule
- job shop
- optimal solution
- simulated annealing
- mobile robot
- material handling
- free space
- lot sizing
- neural network
- completion times
- single server
- production system
- dynamic programming
- search algorithm
- lot streaming