Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots (Q420153)

Summary: Handling rapidly evolving technology and almost daily changes in demand and customer satisfaction, while maintaining competitiveness in a highly competitive environment, requires good coordination and planning of both production and logistics activities on the shop floor, namely: machines and tools. The goal is to optimize costs and reduce delivery lead times in order to provide the customer just in time; we focus on the job shop scheduling problem (JSSP), which is one of the most complex problems encountered in real shop floor. In this paper, we study a generalized (JSSP) including transportation times and a set of additional constraints on the number of transporter vehicles and their multiple transfer capabilities and also on the limited capacity of input/output of machines. The objective is to minimize in one hand tardiness and earliness penalties on delays and advances compared to the lead-time delivery of finished jobs and on the other hand the number of empty moves of transporter vehicles.