|
| << 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 22 van 24 gevonden artikelen
| Titel: |
Scheduling about an unrestricted common due window with arbitrary earliness/tardiness penalty rates |
| Auteur: |
Azizoglu, Meral Webster, Scott |
| Verschenen in: |
IIE transactions |
| Paginering: | Jaargang 29 (1997) nr. 11 pagina's 1001-1006 |
| Jaar: |
1997-11-01 |
| Inhoud: |
We consider the NP-hard problem of scheduling jobs on a single machine about an unrestricted due window to minimize total weighted earliness and tardiness cost. Each job has an earliness penalty rate and a tardiness penalty rate that are allowed to be arbitrary. Earliness or tardiness cost is assessed when a job completes outside the due window, which may be an instant in time or a time increment defining acceptable job completion. In this paper we present properties that characterize the structure of an optimal schedule, present a lower bound, propose a two-step branch and bound algorithm, and report results from a computational experiment. We find that optimal solutions can be quickly obtained for medium-sized problem instances. |
| Uitgever: |
Taylor & Francis |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 22 van 24 gevonden artikelen
| << vorige | volgende >> |