A 3/2 Algorithm for Two-Machine Open Shop with Route-Dependent Processing Times |
| |
| Authors: | V. A. Strusevich A. J. A. van de Waart R. Dekker |
| |
| Affiliation: | (1) University of Greenwich, London, U.K.;(2) Erasmus University, Rotterdam, The Netherlands |
| |
| Abstract: | This paper considers the problem of minimizing the schedule length of a two-machine shop in which not only can a job be assigned any of the two possible routes, but also the processing times depend on the chosen route. This problem is known to be NP-hard. We describe a simple approximation algorithm that guarantees a worst-case performance ratio of 2. We also present some modifications to this algorithm that improve its performance and guarantee a worst-case performance ratio of 3/2. |
| |
| Keywords: | approximation open shop scheduling heuristics worst-case analysis |
| 本文献已被 SpringerLink 等数据库收录！ |
