|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 12 van 14 gevonden artikelen
| Titel: |
Scheduling Problems With Generalized Due Dates |
| Auteur: |
Hall, Nicholas G. |
| Verschenen in: |
IIE transactions |
| Paginering: | Jaargang 18 (1986) nr. 2 pagina's 220-222 |
| Jaar: |
1986-06-01 |
| Inhoud: |
We define a new class of scheduling problems, for which due dates are specified in terms of the position in which a job appears in an ordered sequence, rather than by that job's identity. This problem class appears rich both in applications and in theoretical issues. For many traditional scheduling problems there exists an equivalent problem within the new class. We examine the algorithmic complexity of several of these problems, and attempt to provide an efficient solution technique, or alternatively to demonstrate that such a technique is highly unlikely to exist. In two cases, the complexity of the problem being discussed remains open. |
| Uitgever: |
Taylor & Francis |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 12 van 14 gevonden artikelen
| << vorige | volgende >> |