A dispatching algorithm for parallel machines with rework processes / Y. H. Kang in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 144–155 Titre : A dispatching algorithm for parallel machines with rework processes Type de document : texte imprimé Auteurs : Y. H. Kang, Auteur ; S. S. Kim, Auteur ; J. H. Shin, Auteur Année de publication : 2011 Article en page(s) : pp. 144–155 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Rework probability Parallel machines Dispatching algorithm Sequence-dependent setup times Index. décimale : 001.424 Résumé : This paper presents a parallel machine scheduling problem with rework probabilities, due-dates and sequence-dependent setup times. It is assumed that rework probability for each job on a machine can be given through historical data acquisition. Since the problem is NP-hard in the strong sense, a heuristic algorithm is presented, which finds good solutions. The dispatching algorithm named MRPD (minimum rework probability with due-dates) is proposed in this paper focusing on the rework processes. The performance of MRPD is measured by the six diagnostic indicators: total tardiness, maximum lateness, mean flow-time, mean lateness, the number of reworks and the number of tardy jobs. A large number of test problems are randomly generated to evaluate the performance of the proposed algorithm. Computational results show that the proposed algorithm is significantly superior to existing dispatching algorithms for the test problems. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008148a.html [article] A dispatching algorithm for parallel machines with rework processes [texte imprimé] / Y. H. Kang, Auteur ; S. S. Kim, Auteur ; J. H. Shin, Auteur . - 2011 . - pp. 144–155. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 144–155 Mots-clés : Rework probability Parallel machines Dispatching algorithm Sequence-dependent setup times Index. décimale : 001.424 Résumé : This paper presents a parallel machine scheduling problem with rework probabilities, due-dates and sequence-dependent setup times. It is assumed that rework probability for each job on a machine can be given through historical data acquisition. Since the problem is NP-hard in the strong sense, a heuristic algorithm is presented, which finds good solutions. The dispatching algorithm named MRPD (minimum rework probability with due-dates) is proposed in this paper focusing on the rework processes. The performance of MRPD is measured by the six diagnostic indicators: total tardiness, maximum lateness, mean flow-time, mean lateness, the number of reworks and the number of tardy jobs. A large number of test problems are randomly generated to evaluate the performance of the proposed algorithm. Computational results show that the proposed algorithm is significantly superior to existing dispatching algorithms for the test problems. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008148a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire