On unit time open shops with additional restrictions |
| |
Authors: | Thomas Tautenhahn |
| |
Institution: | 1. Institut für Algebra und Geometrie, Fakult?t für Mathematik, Otto-von-Guericke-Universit?t, Postfach 4120, 39016, Magdeburg, Germany
|
| |
Abstract: | We consider open shop problems with unit processing times,n jobs have to be processed onm machines. The order in which a given job is processed on the machines is not fixed. For each job a release time or a due
date may be given. Additional, we consider the restriction that every machine must perform all corresponding operations without
any delay time. Unit time open shop problems with release times to minimize total completion time were unsolved up to now
for both allowed and forbidden delay times. We will solve these problems in the case of two and three machines. Furthermore
we will give polynomial algorithms for several no-delay-problems with due dates. |
| |
Keywords: | Scheduling open shop |
本文献已被 SpringerLink 等数据库收录! |
|