Scheduling twin robots on a line
This paper introduces the Twin Robots Scheduling Problem (TRSP), in which two robots positioned at the opposite ends of a rail are required to deliver items to positions along the rail, and the objective is to minimize the makespan. A proof of N P-hardness of the TRSP is presented, along with exact...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2014-03.
|
| Subjects: | |
| Online Access: | Get fulltext |