|
| << 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 10 van 16 gevonden artikelen
| Titel: |
Heuristic procedures for the single machine problem to minimize maximum lateness |
| Auteur: |
Larson, R. E. Dessouky, M. I. |
| Verschenen in: |
IIE transactions |
| Paginering: | Jaargang 10 (1978) nr. 2 pagina's 176-183 |
| Jaar: |
1978-06-01 |
| Inhoud: |
Eleven heuristic procedures are presented for sequencing n jobs on one machine to minimize the maximum job lateness when the jobs may have different ready times, processing times, and due dates. The performances of seven procedures that are shown to be representative of all eleven are evaluated on sets of sample problems against optimal solutions derived by a branch-and-bound algorithm. The main measures of each procedure's comparative quality are (1) the mean number of time units by which its solution exceeds the optimal solution and (2) the percentage of times that an optimal sequence is attained. The motivation for employing heuristic procedures is to obtain a sequence that will provide a satisfactory practical response to real world scheduling problems with minimum computational effort. |
| Uitgever: |
Taylor & Francis |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 10 van 16 gevonden artikelen
| << vorige | volgende >> |