We consider the two-stage hybrid flowshop problem with the objective of minimizing the total number of tardy jobs. Since this problem is strongly NP-hard, several heuristic algorithms are developed to find optimal or near optimal schedule for the case when the first stage contains only one machine and the second stage contains rn identical parallel machines. Results of computational tests in solving problems up to 100 jobs are reported and directions for future research are provided.
机构:
Univ Bordeaux, IMB UMR CNRS 5251, Inria Bordeaux Sud Ouest, Bordeaux, FranceUniv Bordeaux, IMB UMR CNRS 5251, Inria Bordeaux Sud Ouest, Bordeaux, France
Clautiaux, Francois
Detienne, Boris
论文数: 0引用数: 0
h-index: 0
机构:
Univ Bordeaux, IMB UMR CNRS 5251, Inria Bordeaux Sud Ouest, Bordeaux, FranceUniv Bordeaux, IMB UMR CNRS 5251, Inria Bordeaux Sud Ouest, Bordeaux, France
Detienne, Boris
Lefebvre, Henri
论文数: 0引用数: 0
h-index: 0
机构:
Univ Bologna, Dipartimento Ingn Energia Elettr & Informaz Guglie, Bologna, ItalyUniv Bordeaux, IMB UMR CNRS 5251, Inria Bordeaux Sud Ouest, Bordeaux, France
机构:
Univ Puerto Rico Rio Piedras, Dept Gerencia, Fac Adm Empresas, San Juan, PR 00931 USAUniv Puerto Rico Rio Piedras, Dept Gerencia, Fac Adm Empresas, San Juan, PR 00931 USA
Ruiz-Torres, Alex J.
Ablanedo-Rosas, Jose H.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Texas El Paso, Dept Informat & Decis Sci, Coll Business Adm, El Paso, TX 79968 USAUniv Puerto Rico Rio Piedras, Dept Gerencia, Fac Adm Empresas, San Juan, PR 00931 USA
Ablanedo-Rosas, Jose H.
Ho, Johnny C.
论文数: 0引用数: 0
h-index: 0
机构:
Columbus State Univ, Turner Coll Business, Columbus, GA 31907 USAUniv Puerto Rico Rio Piedras, Dept Gerencia, Fac Adm Empresas, San Juan, PR 00931 USA