In job-shop manufacturing systems, an efficient production schedule acts to reduce unnecessary costs and better manage resources. For the same purposes, modern manufacturing cells, in compliance with industry 4.0 concepts, use material handling systems in order to allow more control on the transport tasks. In this paper, a job-shop scheduling problem in vehicle based manufacturing facility that is mainly related to job assignment to resources is addressed. The considered job-shop production cell has two types of resources: processing resources that accomplish fabrication tasks for specific products, and transporting resources that assure parts’ transport to the processing area. A Variable Neighborhood Search algorithm is used to schedule product manufacturing and handling tasks in the aim to minimize the maximum completion time of a job set and an improved lower bound with new calculation method is presented. Experimental tests are conducted to evaluate the efficiency of the proposed approach.

在车间生产系统中，有效的生产计划可减少不必要的成本并更好地管理资源。出于相同的目的，符合工业4.0概念的现代制造单元使用物料搬运系统，以便对运输任务进行更多控制。在本文中，解决了基于车辆的制造工厂中的车间调度问题，该问题主要与资源的任务分配有关。所考虑的车间生产单元具有两种资源：用于完成特定产品制造任务的处理资源，以及用于确保零件运输到加工区域的运输资源。可变邻域搜索算法用于调度产品制造和处理任务，以最大程度地减少作业集的最大完成时间，并提出了一种采用新计算方法的改进下界。进行实验测试以评估所提出方法的效率。