|
| volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 1 van 9 gevonden artikelen
| Titel: |
A (10/7)-approximation algorithm for an optimum cyclic solution in additive travel-time robotic cells |
| Auteur: |
Geismar, H. Neil Dawande, Milind Sriskandarajah, Chelliah |
| Verschenen in: |
IIE transactions |
| Paginering: | Jaargang 39 (2007) nr. 2 pagina's 217-227 |
| Jaar: |
2007-02-01 |
| Inhoud: |
This paper considers the problem of scheduling operations in bufferless robotic cells that produce identical parts. Finding a cyclic solution that minimizes the long-run average time to produce a part has long been a fundamental open problem. Most research has been focused on finding an optimal 1-unit cyclic solution. However, it is known that an optimal multi-unit cyclic solution can be better than an optimal 1-unit cyclic solution for cells with four or more machines. For additive travel-time cells, we present a linear-time algorithm that produces a cyclic solution whose per unit cycle time is within a factor of 10/7 of the optimum. This result improves the current best 3/2-approximation guarantee. |
| Uitgever: |
Taylor & Francis |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 1 van 9 gevonden artikelen
| volgende >> |