Single-machine scheduling to minimize total absolute differences in waiting times with deteriorating jobs / Sun, L.-H. in Journal of the operational research society (JORS), Vol. 62 N° 4 (Avril 2011)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 62 N° 4 (Avril 2011) . - pp. 768–775 Titre : Single-machine scheduling to minimize total absolute differences in waiting times with deteriorating jobs Type de document : texte imprimé Auteurs : Sun, L.-H., Auteur ; Sun, L.-Y., Auteur ; Wang, J.-B., Auteur Année de publication : 2011 Article en page(s) : pp. 768–775 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling Single machine Deteriorating jobs Total absolute differences in waiting times Heuristic algorithm Index. décimale : 001.424 Résumé : In this paper we consider a single-machine scheduling problem with simple linear deterioration. By simple linear deterioration, we mean that the processing time of a job is a simple linear function of its execution starting time and its deterioration rate. The objective is to find a schedule that minimizes total absolute differences in waiting times. We show that the optimal schedule is V-shaped: jobs are arranged in descending order of their deterioration rates if they are placed before the job with the smallest deterioration rate, but in ascending order of their deterioration rates if placed after it. We prove other several properties of an optimal schedule, and introduce two efficient heuristic algorithms that are tested against a lower bound. We also provide computational results to evaluate the performance of the heuristic algorithms. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n4/abs/jors201026a.html [article] Single-machine scheduling to minimize total absolute differences in waiting times with deteriorating jobs [texte imprimé] / Sun, L.-H., Auteur ; Sun, L.-Y., Auteur ; Wang, J.-B., Auteur . - 2011 . - pp. 768–775. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 4 (Avril 2011) . - pp. 768–775 Mots-clés : Scheduling Single machine Deteriorating jobs Total absolute differences in waiting times Heuristic algorithm Index. décimale : 001.424 Résumé : In this paper we consider a single-machine scheduling problem with simple linear deterioration. By simple linear deterioration, we mean that the processing time of a job is a simple linear function of its execution starting time and its deterioration rate. The objective is to find a schedule that minimizes total absolute differences in waiting times. We show that the optimal schedule is V-shaped: jobs are arranged in descending order of their deterioration rates if they are placed before the job with the smallest deterioration rate, but in ascending order of their deterioration rates if placed after it. We prove other several properties of an optimal schedule, and introduce two efficient heuristic algorithms that are tested against a lower bound. We also provide computational results to evaluate the performance of the heuristic algorithms. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n4/abs/jors201026a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire