Scheduling jobs with chain precedence constraints and deteriorating jobs / Wang, J.-B. in Journal of the operational research society (JORS), Vol. 62 N° 9 (Septembre 2011)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 62 N° 9 (Septembre 2011) . - pp. 1765–1770 Titre : Scheduling jobs with chain precedence constraints and deteriorating jobs Type de document : texte imprimé Auteurs : Wang, J.-B., Auteur ; J-J. Wang, Auteur ; P. Ji, Auteur Année de publication : 2011 Article en page(s) : pp. 1765–1770 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling Single machine Deteriorating jobs Weighted sum of squared completion times Index. décimale : 001.424 Résumé : In this paper we consider a single machine scheduling problem with deteriorating jobs. By deteriorating jobs, we mean that the processing time of a job is a simple linear function of its execution starting time. For the jobs with chain precedence constraints, we prove that the weighted sum of squared completion times minimization problem with strong chains and weak chains can be solved in polynomial time, respectively. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n9/abs/jors2010120a.html [article] Scheduling jobs with chain precedence constraints and deteriorating jobs [texte imprimé] / Wang, J.-B., Auteur ; J-J. Wang, Auteur ; P. Ji, Auteur . - 2011 . - pp. 1765–1770. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 9 (Septembre 2011) . - pp. 1765–1770 Mots-clés : Scheduling Single machine Deteriorating jobs Weighted sum of squared completion times Index. décimale : 001.424 Résumé : In this paper we consider a single machine scheduling problem with deteriorating jobs. By deteriorating jobs, we mean that the processing time of a job is a simple linear function of its execution starting time. For the jobs with chain precedence constraints, we prove that the weighted sum of squared completion times minimization problem with strong chains and weak chains can be solved in polynomial time, respectively. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n9/abs/jors2010120a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire