Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
 
<< 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 7 van 10 gevonden artikelen
 
 
  Improving scheduling robustness via preprocessing and dynamic adaptation
 
 
Titel: Improving scheduling robustness via preprocessing and dynamic adaptation
Auteur: Kutanoglu, Erhan
Wu, S. David
Verschenen in: IIE transactions
Paginering: Jaargang 36 (2004) nr. 11 pagina's 1107-1124
Jaar: 2004-11
Inhoud: We study methods to improve scheduling robustness under processing time variation. We propose a two-stage scheme that preprocesses the scheduling data to create a skeleton of a schedule and then completes it over time through dynamic adaptation. We focus our attention on the classical job shop scheduling problem. Preprocessing starts at the beginning of the planning period (at the time of scheduling) when a priori information becomes available on processing time uncertainty. We first decompose the job shop scheduling problem into network-structured subproblems using Lagrangian relaxation. For each subproblem, we introduce stochastic constraints that capture the processing time uncertainty. We incorporate the stochastic information in such a way that the subproblems retain their efficient network structure. Using a subgradient search algorithm, we iteratively improve the lower and upper bounds obtained from the Lagrangian relaxed problem, which produce a partial sequence of critical operations. This so-called Lagrangian ranking defines a preprocessed schedule where the complete scheduling is determined dynamically over time, adapting to changing shop conditions. We test the robustness of the two-stage scheme through extensive computational experiments. We show that the scheme significantly outperforms deterministic scheduling methods and dynamic dispatching rules with minimal computational burden.
Uitgever: Taylor & Francis
Bronbestand: Elektronische Wetenschappelijke Tijdschriften
 
 

                             Details van artikel 7 van 10 gevonden artikelen
 
<< vorige    volgende >>
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland