Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria / Ozlen, M. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 152-164 Titre : Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria Type de document : texte imprimé Auteurs : Ozlen, M., Auteur ; Azizoglu, M., Auteur Année de publication : 2011 Article en page(s) : pp. 152-164 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Rescheduling Unrelated parallel machines Efficient schedules Index. décimale : 001.424 Résumé : In this paper, we consider a rescheduling problem where a set of jobs has already been assigned to unrelated parallel machines. When a disruption occurs on one of the machines, the affected jobs are rescheduled, considering the efficiency and the schedule deviation measures. The efficiency measure is the total flow time, and the schedule deviation measure is the total disruption cost caused by the differences between the initial and current schedules. We provide polynomial-time solution methods to the following hierarchical optimization problems: minimizing total disruption cost among the minimum total flow time schedules and minimizing total flow time among the minimum total disruption cost schedules. We propose exponential-time algorithms to generate all efficient solutions and to minimize a specified function of the measures. Our extensive computational tests on large size problem instances have revealed that our optimization algorithm finds the best solution by generating only a small portion of all efficient solutions. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009157a.html [article] Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria [texte imprimé] / Ozlen, M., Auteur ; Azizoglu, M., Auteur . - 2011 . - pp. 152-164. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 152-164 Mots-clés : Rescheduling Unrelated parallel machines Efficient schedules Index. décimale : 001.424 Résumé : In this paper, we consider a rescheduling problem where a set of jobs has already been assigned to unrelated parallel machines. When a disruption occurs on one of the machines, the affected jobs are rescheduled, considering the efficiency and the schedule deviation measures. The efficiency measure is the total flow time, and the schedule deviation measure is the total disruption cost caused by the differences between the initial and current schedules. We provide polynomial-time solution methods to the following hierarchical optimization problems: minimizing total disruption cost among the minimum total flow time schedules and minimizing total flow time among the minimum total disruption cost schedules. We propose exponential-time algorithms to generate all efficient solutions and to minimize a specified function of the measures. Our extensive computational tests on large size problem instances have revealed that our optimization algorithm finds the best solution by generating only a small portion of all efficient solutions. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009157a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire