Citation
A Disjunctive Graph for the Job-Shop with Several Robots. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 285-292, 2007.
Paper
Abstract
This paper addresses the scheduling problem in a job-shop where the jobs have to be transported between the machines by several transport robots. The problem can be efficiently modeled by a disjunctive graph and any solution can be fully defined by an orientation of the graph. The objective is to determine a schedule of machine and transport operations as well as an assignment of robots to transport operations with minimal makespan. We present: (i) a problem representation using an appropriate disjunctive graph; (ii) a solution representation based on 3 vectors consisting of machine disjunctions, transport disjunctions and robots assignments; (iii) a new problem-specific properties to define local search algorithms. Computational results are presented for test data arising from Bilge and Uluzoy’s benchmark instances enlarged by transportation, empty moving times for each robot. This paper is a step forward definition of an efficient approach arising a job-shop with several robots and it is an attempt to extend the Hurink and Knust proposal dedicated to one single transport robot.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2007-285-292-P, author = {P. Lacomme and M. Larabi and N. Tchernev},
title = {A Disjunctive Graph for the Job-Shop with Several Robots},
booktitle = {In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France},
year = {2007},
editor = {P. Baptiste and G. Kendall and A. Munier-Kordon and F. Sourd},
pages = {285--292},
note = {Paper},
abstract = {This paper addresses the scheduling problem in a job-shop where the jobs have to be transported between the machines by several transport robots. The problem can be efficiently modeled by a disjunctive graph and any solution can be fully defined by an orientation of the graph. The objective is to determine a schedule of machine and transport operations as well as an assignment of robots to transport operations with minimal makespan. We present: (i) a problem representation using an appropriate disjunctive graph; (ii) a solution representation based on 3 vectors consisting of machine disjunctions, transport disjunctions and robots assignments; (iii) a new problem-specific properties to define local search algorithms. Computational results are presented for test data arising from Bilge and Uluzoy’s benchmark instances enlarged by transportation, empty moving times for each robot. This paper is a step forward definition of an efficient approach arising a job-shop with several robots and it is an attempt to extend the Hurink and Knust proposal dedicated to one single transport robot.},
owner = {user},
timestamp = {2012.05.21},
webpdf = {2007-285-292-P.pdf} }