Documents disponibles écrits par cet auteur

Single machine scheduling with sequence-dependent family setups to minimize maximum lateness / F. Jin in Journal of the operational research society (JORS), Vol. 61 N° 7 (Juillet 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1181–1189 Titre : Single machine scheduling with sequence-dependent family setups to minimize maximum lateness Type de document : texte imprimé Auteurs : F. Jin, Auteur ; J. N. D. Gupta, Auteur ; S. Song, Auteur Année de publication : 2011 Article en page(s) : pp. 1181–1189 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Single  machine  Sequence-dependent  family  setup  times  Maximum  lateness  or  tardiness  Structura  Properties  Tabu  search  Empirical  results Index. décimale : 001.424 Résumé : Motivated by a real-life scheduling problem in a steel wire factory in China, this paper considers the single machine scheduling problem with sequence-dependent family setup times to minimize maximum lateness. In view of the NP-hard nature of the problem, structural (dominance and neighbourhood) properties of the problem are described and used in the tabu search algorithms to find optimal or near-optimal schedules. These proposed structural properties quickly exclude unpromising and/or non-improving neighbours from further search. Empirical results on the randomly generated and real-life problem instances from a factory in China show that the proposed heuristic algorithms utilizing the structural properties can obtain optimal or near optimal solutions with a reasonable computational effort. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200963a.html [article] Single machine scheduling with sequence-dependent family setups to minimize maximum lateness [texte imprimé] / F. Jin, Auteur ; J. N. D. Gupta, Auteur ; S. Song, Auteur . - 2011 . - pp. 1181–1189. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1181–1189 Mots-clés : Single  machine  Sequence-dependent  family  setup  times  Maximum  lateness  or  tardiness  Structura  Properties  Tabu  search  Empirical  results Index. décimale : 001.424 Résumé : Motivated by a real-life scheduling problem in a steel wire factory in China, this paper considers the single machine scheduling problem with sequence-dependent family setup times to minimize maximum lateness. In view of the NP-hard nature of the problem, structural (dominance and neighbourhood) properties of the problem are described and used in the tabu search algorithms to find optimal or near-optimal schedules. These proposed structural properties quickly exclude unpromising and/or non-improving neighbours from further search. Empirical results on the randomly generated and real-life problem instances from a factory in China show that the proposed heuristic algorithms utilizing the structural properties can obtain optimal or near optimal solutions with a reasonable computational effort. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200963a.html