Research

Job-Shop Scheduling with Cooperative Transportation Resources (JSTP-C)

The Job-Shop scheduling Problem (JSP) is one of the most known problems in the domain of production task scheduling. The Job-Shop scheduling Problem with Transportation resources (JSPT) is a generalization of the classical JSP and consists of jointly scheduling production operations and transport operations which are performed by automated vehicles also called mobile robots.

In this work, the JSPT is examined from a more general perspective, where each transport operation can require the simultaneous use of several specialized robots due to the unique characteristics and handling requirements of each job, encompassing factors like size, weight and fragility. The originality of this work lies in considering the JSPT environment with the assumption that a transport operation may require the cooperation of several robots in carrying a job from a machine to another which requires proper synchronization between robots over time. We call this new variant the Job-Shop scheduling Problem with Cooperative Transportation resources (JSPT-C). To the best of our knowledge this problem has never been studied before. Note that synchronization issues appear in other problems including the Vehicle Routing Problem where the synchronization can involve, for instance, vehicles, drivers or medical staff. Read more...