This paper addresses an extension of the flexible job shop scheduling problem by considering that jobs need to be moved around the shop-floor by a set of vehicles. Thus, this problem involves assigning each production operation to one of the alternative machines, finding the sequence of operations for each machine, assigning each transport task to one of the vehicles, and finding the sequence of transport tasks for each vehicle, simultaneously. Transportation is usually neglected in the literature and when considered, an unlimited number of vehicles is, typically, assumed. Here, we propose the first mixed integer linear programming model for this problem and show its efficiency at solving small-sized instances to optimality. In addition, and due to the NP-hard nature of the problem, we propose a local search based heuristic that the computational experiments show to be effective, efficient, and robust.

本文考虑到需要通过一组车辆在车间周围移动工作，从而解决了灵活的车间调度问题的扩展。因此，该问题涉及将每个生产操作分配给替代机器之一，找到每个机器的操作顺序，将每个运输任务分配给其中一辆车辆，并同时找到每个车辆的运输任务顺序。运输通常在文献中被忽略，考虑到这一点，通常假定车辆数量不受限制。在这里，我们提出了第一个混合整数线性规划模型来解决这个问题，并展示了其在解决小型实例最优问题上的效率。另外，由于该问题的NP难性，