Scheduling non-permutation flowshop with finite buffers and two competitive agents.
Danyu BaiTianyi LiuYuchen ZhangTao RenZhi-Hai ZhangZhiqiang DongPublished in: Comput. Ind. Eng. (2023)
Keyphrases
- permutation flowshop
- scheduling problem
- total flowtime
- multi agent systems
- multi agent
- np hard
- single machine
- resource allocation
- setup times
- multiagent systems
- autonomous agents
- flowshop
- intelligent agents
- resource allocation and scheduling
- processing times
- mobile agents
- upper bound
- decision making
- strongly np hard
- tabu search
- release dates
- scheduling algorithm
- state space
- finite number
- search algorithm
- sequence dependent setup times
- optimal solution
- reinforcement learning