A note on due-date assignment and single-machine scheduling with deteriorating jobs and learning effects / Kuo, W.-H. 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. 206–210 Titre : A note on due-date assignment and single-machine scheduling with deteriorating jobs and learning effects Type de document : texte imprimé Auteurs : Kuo, W.-H., Auteur ; D.-L. Yang, Auteur Année de publication : 2011 Article en page(s) : pp. 206–210 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling Single-machine Deteriorating jobs Learning effects Index. décimale : 001.424 Résumé : The concepts of deteriorating jobs and learning effects have been individually studied in many scheduling problems. This note considers a single-machine scheduling problem with deteriorating jobs and learning effects. All of the jobs have a common (but unknown) due date. The objective is to minimize the sum of the weighted earliness, tardiness and due-date penalties. An O(n3) algorithm is proposed to optimally solve the problem with deteriorating jobs and job-dependent learning effect. Besides, an O(n log n) algorithm is provided to solve the problem with deteriorating jobs and job-independent learning effect. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009155a.html [article] A note on due-date assignment and single-machine scheduling with deteriorating jobs and learning effects [texte imprimé] / Kuo, W.-H., Auteur ; D.-L. Yang, Auteur . - 2011 . - pp. 206–210. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 206–210 Mots-clés : Scheduling Single-machine Deteriorating jobs Learning effects Index. décimale : 001.424 Résumé : The concepts of deteriorating jobs and learning effects have been individually studied in many scheduling problems. This note considers a single-machine scheduling problem with deteriorating jobs and learning effects. All of the jobs have a common (but unknown) due date. The objective is to minimize the sum of the weighted earliness, tardiness and due-date penalties. An O(n3) algorithm is proposed to optimally solve the problem with deteriorating jobs and job-dependent learning effect. Besides, an O(n log n) algorithm is provided to solve the problem with deteriorating jobs and job-independent learning effect. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009155a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire