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 2 van 8 gevonden artikelen
 
 
  An efficient priority rule for scheduling job shops to minimize mean tardiness
 
 
Titel: An efficient priority rule for scheduling job shops to minimize mean tardiness
Auteur: Weng, M. X.
Ren, Haiying
Verschenen in: IIE transactions
Paginering: Jaargang 38 (2006) nr. 9 pagina's 789-795
Jaar: 2006-09-01
Inhoud: The ability to respond quickly to customer demands is a key factor in successfully competing in today's globally competitive markets. Thus, meeting due dates could be the most important goal of scheduling in many manufacturing and service industries. Meeting due dates can naturally be translated into minimizing job tardiness. In this paper we present a priority rule for dynamic job shop scheduling that minimizes mean job tardiness. The rule is developed based on the characteristics of existing dispatching rules. With job due dates set by the generalized total work content rule, the computational results of simulation experiments show that the proposed dispatching rule consistently, and often, significantly outperforms a number of well-known priority rules in the literature. The proposed rule is also robust being the best or near-best rule for reducing the mean flowtime, for all the shop load levels and due date tightness factors tested.
Uitgever: Taylor & Francis
Bronbestand: Elektronische Wetenschappelijke Tijdschriften
 
 

                             Details van artikel 2 van 8 gevonden artikelen
 
<< vorige    volgende >>
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland