Referenced Items are not available for this document.
A classical two-job shop problem deals with the determination of an optimal schedule of operations fixed by the technological process. In this paper, we address a generalization of such a problem by introducing the routing flexibility on the realization of jobs. The sequence a job follows in order to be performed is not fixed but must be computed from several alternatives. A polynomial algorithm, based on the geometric approach for the two-job shop problem, is developed for solving a particular case with two jobs. The algorithm applies for the minimization of any regular objective function.
Published in:
Robotics and Automation, 2003. Proceedings. ICRA '03. IEEE International Conference on
(Volume:1
)
Date of Conference: 14-19 Sept. 2003
- Page(s):
- 157 - 162 vol.1
- ISSN :
- 1050-4729
- Print ISBN:
- 0-7803-7736-2
- INSPEC Accession Number:
- 7869762
- Digital Object Identifier :
- 10.1109/ROBOT.2003.1241589
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
