Abstract:
This paper deals with one of the most challenging decisional problems in multi-robot based production systems. It is related to tasks (products) scheduling, which require...Show MoreMetadata
Abstract:
This paper deals with one of the most challenging decisional problems in multi-robot based production systems. It is related to tasks (products) scheduling, which requires the allocation of operations and their sequencing on the robots, while satisfying tasks and robots constraints under makespan minimization.
Date of Conference: 23-26 October 2016
Date Added to IEEE Xplore: 22 December 2016
ISBN Information:
Keywords assist with retrieval of results and provide a means to discovering other relevant content. Learn more.
- IEEE Keywords
- Index Terms
- Task Scheduling ,
- Priority Rules ,
- Local Agencies ,
- Object Location ,
- Negotiation Process ,
- Makespan ,
- Location Of Operations ,
- Processing Time ,
- Urban Planning ,
- Operation Time ,
- Acquaintances ,
- Completion Time ,
- Local Optimum ,
- Solution Quality ,
- Multi-agent Systems ,
- Chromosome Pairs ,
- Centralized Approach ,
- Total Execution Time ,
- Distributed Architecture ,
- Host Computer ,
- Set Of Robots ,
- Dynamic Disturbance ,
- Resolution Approach ,
- Maximum Completion Time
- Author Keywords
Contents Keywords assist with retrieval of results and provide a means to discovering other relevant content. Learn more.
- IEEE Keywords
- Index Terms
- Task Scheduling ,
- Priority Rules ,
- Local Agencies ,
- Object Location ,
- Negotiation Process ,
- Makespan ,
- Location Of Operations ,
- Processing Time ,
- Urban Planning ,
- Operation Time ,
- Acquaintances ,
- Completion Time ,
- Local Optimum ,
- Solution Quality ,
- Multi-agent Systems ,
- Chromosome Pairs ,
- Centralized Approach ,
- Total Execution Time ,
- Distributed Architecture ,
- Host Computer ,
- Set Of Robots ,
- Dynamic Disturbance ,
- Resolution Approach ,
- Maximum Completion Time
- Author Keywords
