Table of Contents
ISRN Applied Mathematics
Volume 2011 (2011), Article ID 165620, 19 pages
Research Article

Ant Colony Algorithm for Just-in-Time Job Shop Scheduling with Transportation Times and Multirobots

1CERENE, ISEL, Quai Frissard, BP 1137, 76063 Le Havre Cedex, France
2Modelling Laboratory and Scientific Computing, Faculty of Science and Technology, BP 2202, Route D'Imouzzer Fez, Morocco

Received 27 March 2011; Accepted 27 April 2011

Academic Editor: S. G. Garcia

Copyright © 2011 Fatima El Khoukhi et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.