# A polynomial algorithm for the three-machine open shop with a bottleneck machine

Tools

Drobouchevitch, Inna G. and Strusevich, Vitaly A.
(1999)
*A polynomial algorithm for the three-machine open shop with a bottleneck machine.*
Annals of Operations Research, 92.
pp. 185-210.
ISSN 0254-5330 (Print), 1572-9338 (Online)
(doi:10.1023/A:1018982630730)

Official URL: http://dx.doi.org/10.1023/A:1018982630730

## Abstract

The paper considers the three‐machine open shop scheduling problem to minimize themakespan. It is assumed that each job consists of at most two operations, one of which is tobe processed on the bottleneck machine, the same for all jobs. A new lower bound on theoptimal makespan is derived, and a linear‐time algorithm for finding an optimalnon‐preemptive schedule is presented.

Item Type: | Article |
---|---|

Uncontrolled Keywords: | open shop scheduling, lower bound, polynomial algorithm |

Subjects: | Q Science > QA Mathematics |

Pre-2014 Departments: | School of Computing & Mathematical Sciences School of Computing & Mathematical Sciences > Department of Mathematical Sciences School of Computing & Mathematical Sciences > Statistics & Operational Research Group |

Related URLs: | |

Last Modified: | 14 Oct 2016 08:59 |

URI: | http://gala.gre.ac.uk/id/eprint/216 |

### Actions (login required)

View Item |