Minimizing the sum of maximum earliness and maximum tardiness in the single-machine scheduling problem with sequence-dependent setup time / Nekoiemehr, N. in Journal of the operational research society (JORS), Vol. 62 N° 7 (Juillet 2011)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 62 N° 7 (Juillet 2011) . - pp. 1403–1412 Titre : Minimizing the sum of maximum earliness and maximum tardiness in the single-machine scheduling problem with sequence-dependent setup time Type de document : texte imprimé Auteurs : Nekoiemehr, N., Auteur ; Moslehi, G., Auteur Année de publication : 2011 Article en page(s) : pp. 1403–1412 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling Single machine Maximum earliness tardiness Setup time Index. décimale : 001.424 Résumé : This paper considers the problem of scheduling a given number of jobs on a single machine to minimize the sum of maximum earliness and maximum tardiness when sequence-dependent setup times exist (1|STsd|ETmax). In this paper, an optimal branch-and-bound algorithm is developed that involves the implementation of lower and upper bounding procedures as well as three dominance rules. For solving problems containing large numbers of jobs, a polynomial time-bounded heuristic algorithm is also proposed. Computational experiments demonstrate the effectiveness of the bounding and dominance rules in achieving optimal solutions in more than 97% of the instances. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n7/abs/jors201094a.html [article] Minimizing the sum of maximum earliness and maximum tardiness in the single-machine scheduling problem with sequence-dependent setup time [texte imprimé] / Nekoiemehr, N., Auteur ; Moslehi, G., Auteur . - 2011 . - pp. 1403–1412. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 7 (Juillet 2011) . - pp. 1403–1412 Mots-clés : Scheduling Single machine Maximum earliness tardiness Setup time Index. décimale : 001.424 Résumé : This paper considers the problem of scheduling a given number of jobs on a single machine to minimize the sum of maximum earliness and maximum tardiness when sequence-dependent setup times exist (1|STsd|ETmax). In this paper, an optimal branch-and-bound algorithm is developed that involves the implementation of lower and upper bounding procedures as well as three dominance rules. For solving problems containing large numbers of jobs, a polynomial time-bounded heuristic algorithm is also proposed. Computational experiments demonstrate the effectiveness of the bounding and dominance rules in achieving optimal solutions in more than 97% of the instances. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n7/abs/jors201094a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire