Resolution of a Job-Shop Problem with a Single Transport Robot and Buffer Facilities

This paper addresses the scheduling problem in job-shop with transportation constraints and extra constraints including but not limited to input/output buffer with limited capacity in front of machines. The problem can be efficiently modelized to a disjunctive graph and the solution generation can be limited to generation of transportation sequences. An efficient memetic genetic algorithm is promoted to provide solutions satisfying all system constraints. This work provides numerical experiments including a comparative study with the exact resolution of the problem of (A. Caumond et al., 2006) and the heuristic approach of (P. Lacomme et al., 2005)