Two Schemes of the Branch and Bound Method for a Flow Shop Total Weighted Tardiness Minimization Problem
    
    
  
  
  
      
      
      
        
Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, Tome 154 (2012) no. 3, pp. 180-189
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice du chapitre de livre provenant de la source Math-Net.Ru
            
              Two schemes of the branch and bound method for a flow shop total weighted tardiness minimization problem are suggested in this paper. The first scheme consists in the construction of the schedule in the common order (at the beginning the first work in the schedule is chosen, then the second work, etc.) and the second scheme presupposes the construction of the schedule in the inverse order (at the beginning the last work in the schedule is chosen, then the penultimate work, etc.). It is shown by numerical experiments that the efficiency of the methods strongly depends on the problem's parameters, which can be easily calculated from the initial data. Criteria for choosing the most efficient method for any particular problem are proposed.
            
            
            
          
        
      
                  
                    
                    
                    
                    
                    
                      
Keywords: 
flow shop, branch and bound method, total weighted tardiness minimization.
                    
                  
                
                
                @article{UZKU_2012_154_3_a16,
     author = {I. K. Agapeevich and V. R. Fazylov},
     title = {Two {Schemes} of the {Branch} and {Bound} {Method} for a {Flow} {Shop} {Total} {Weighted} {Tardiness} {Minimization} {Problem}},
     journal = {U\v{c}\"enye zapiski Kazanskogo universiteta. Seri\^a Fiziko-matemati\v{c}eskie nauki},
     pages = {180--189},
     publisher = {mathdoc},
     volume = {154},
     number = {3},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/UZKU_2012_154_3_a16/}
}
                      
                      
                    TY - JOUR AU - I. K. Agapeevich AU - V. R. Fazylov TI - Two Schemes of the Branch and Bound Method for a Flow Shop Total Weighted Tardiness Minimization Problem JO - Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki PY - 2012 SP - 180 EP - 189 VL - 154 IS - 3 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/UZKU_2012_154_3_a16/ LA - ru ID - UZKU_2012_154_3_a16 ER -
%0 Journal Article %A I. K. Agapeevich %A V. R. Fazylov %T Two Schemes of the Branch and Bound Method for a Flow Shop Total Weighted Tardiness Minimization Problem %J Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki %D 2012 %P 180-189 %V 154 %N 3 %I mathdoc %U http://geodesic.mathdoc.fr/item/UZKU_2012_154_3_a16/ %G ru %F UZKU_2012_154_3_a16
I. K. Agapeevich; V. R. Fazylov. Two Schemes of the Branch and Bound Method for a Flow Shop Total Weighted Tardiness Minimization Problem. Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, Tome 154 (2012) no. 3, pp. 180-189. http://geodesic.mathdoc.fr/item/UZKU_2012_154_3_a16/
