logo_limos logoCNRS logo_ubp
Philippe Lacomme
Job-Shop
...

Instances for the

Job-Shop with several single robots


Problem definition :
  •   a finite set of n jobs;
  • each job consists of a sequence of operations
  • a set of m machines with infinite buffer capacity;
  • each machine can process at most one operation at a time;
  • each operation required to be processed during an uninterrupted period of a fixed duration.
  • each machine has one input buffer with unlimited capacity;
  • each machine has one output buffer with unlimited capacity;
  • several transport robots are available;
  • each job transfer from any machine  to any machine requires transport by one robot;
  • transportation time depends on robot and machines
  • transportation time is not linked to the job  under transport


Instances: download
Instances format :                                                       image



References:

[1]  Lacomme P., Larabi M. and Tchernev N., “A Disjunctive Graph for the Job-Shop with several robots”, Subimitted to MISTA conference 2007.