A note: a due-window assignment problem on parallel identical machines / Mosheiov, G. 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. 238–241 Titre : A note: a due-window assignment problem on parallel identical machines Type de document : texte imprimé Auteurs : Mosheiov, G., Auteur ; Sarig, A., Auteur Année de publication : 2011 Article en page(s) : pp. 238–241 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling Parallel machines Earliness–tardiness Due-window Assignment problem Index. décimale : 001.424 Résumé : We solve a due-window assignment problem on parallel identical machines. In addition to the standard objective of finding the optimal job schedule, in due-window assignment problems one has to assign a time interval during which goods are delivered to customers with no cost. Jobs scheduled prior to or after the due-window are penalized according to their earliness/tardiness value. We assume that jobs have identical processing times, but may have job-dependent earliness and tardiness costs (eg, due to possible different destinations). We show that the problem can be reduced to a non-standard asymmetric assignment problem, and introduce an efficient (O(n4)) solution procedure. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009179a.html [article] A note: a due-window assignment problem on parallel identical machines [texte imprimé] / Mosheiov, G., Auteur ; Sarig, A., Auteur . - 2011 . - pp. 238–241. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 238–241 Mots-clés : Scheduling Parallel machines Earliness–tardiness Due-window Assignment problem Index. décimale : 001.424 Résumé : We solve a due-window assignment problem on parallel identical machines. In addition to the standard objective of finding the optimal job schedule, in due-window assignment problems one has to assign a time interval during which goods are delivered to customers with no cost. Jobs scheduled prior to or after the due-window are penalized according to their earliness/tardiness value. We assume that jobs have identical processing times, but may have job-dependent earliness and tardiness costs (eg, due to possible different destinations). We show that the problem can be reduced to a non-standard asymmetric assignment problem, and introduce an efficient (O(n4)) solution procedure. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009179a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire