Minimizing the weighted number of late jobs in UET open shops |
| |
Authors: | Gábor Galambos Gerhard J. Woeginger |
| |
Affiliation: | (1) Department of Computer Science, JGYTF, P.O. Box 396, 6720 Szeged, Hungary;(2) Institut für Theoretische Informatik, TU Graz, Klosterwiesgasse 32/II, 8010 Graz, Austria |
| |
Abstract: | We consider a two-machine open shop problem where the jobs have release dates and due dates, and where all single operations have unit processing times. The goal is to minimize the weighted number of late jobs. We derive a polynomial time algorithm for this problem, thereby answering an open question posed in a recent paper by Brucker et al.This research was supported by the Christian Doppler Laboratorium für Diskrete Optimierung. |
| |
Keywords: | Combinatorial optimization open shop scheduling polynomial algorithm |
本文献已被 SpringerLink 等数据库收录! |
|