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

Single-machine scheduling problems with past-sequence-dependent delivery times and position-dependent processing times / S.-J. Yang in Journal of the operational research society (JORS), Vol. 63 N° 11 (Novembre 2012)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 63 N° 11 (Novembre 2012) . - pp. 1508–1515 Titre : Single-machine scheduling problems with past-sequence-dependent delivery times and position-dependent processing times Type de document : texte imprimé Auteurs : S.-J. Yang, Auteur ; D.-L. Yang, Auteur Année de publication : 2012 Article en page(s) : pp. 1508–1515 Note générale : operational research Langues : Anglais (eng) Mots-clés : scheduling  position-dependent processing times  past-sequence-dependent delivery due-window assignment  total absolute differences in completion waiting times Index. décimale : 001.424 Résumé : This paper considers single-machine scheduling problems with job delivery times where the actual job processing time of a job is defined by a function dependent on its position in a schedule. We assume that the job delivery time is proportional to the job waiting time. We investigate the minimization problems of the sum of earliness, tardiness, and due-window-related cost, the total absolute differences in completion times, and the total absolute differences in waiting times on a single-machine setting. The polynomial time algorithms are proposed to optimally solve the above objective functions. We also investigate some special cases of the problem under study and show that they can be optimally solved by lower order algorithms. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n11/abs/jors2011155a.html [article] Single-machine scheduling problems with past-sequence-dependent delivery times and position-dependent processing times [texte imprimé] / S.-J. Yang, Auteur ; D.-L. Yang, Auteur . - 2012 . - pp. 1508–1515. operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 11 (Novembre 2012) . - pp. 1508–1515 Mots-clés : scheduling  position-dependent processing times  past-sequence-dependent delivery due-window assignment  total absolute differences in completion waiting times Index. décimale : 001.424 Résumé : This paper considers single-machine scheduling problems with job delivery times where the actual job processing time of a job is defined by a function dependent on its position in a schedule. We assume that the job delivery time is proportional to the job waiting time. We investigate the minimization problems of the sum of earliness, tardiness, and due-window-related cost, the total absolute differences in completion times, and the total absolute differences in waiting times on a single-machine setting. The polynomial time algorithms are proposed to optimally solve the above objective functions. We also investigate some special cases of the problem under study and show that they can be optimally solved by lower order algorithms. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n11/abs/jors2011155a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire