Documents disponibles écrits par cet auteur

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]  in Journal 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  times;  due-window  assignment;  total  absolute  differences  in  completion  times;  total  absolute  differences  in  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  times;  due-window  assignment;  total  absolute  differences  in  completion  times;  total  absolute  differences  in  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