Documents disponibles écrits par cet auteur

Scheduling jobs under an aging effect / A. Janiak in Journal of the operational research society (JORS), Vol. 61 N° 6 (Juin 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 6 (Juin 2010) . - pp. 1041–1048 Titre : Scheduling jobs under an aging effect Type de document : texte imprimé Auteurs : A. Janiak, Auteur ; R. Rudek, Auteur Année de publication : 2011 Article en page(s) : pp. 1041–1048 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling  Aging  effect  Deterioration  Computational  analysis Index. décimale : 001.424 Résumé : In this paper a scheduling problem that takes into consideration a phenomenon called ‘aging effect’ with reference to Computer Numerical Control drilling or cutting machines is investigated. In the aftermath of this effect an execution of jobs leads to a deterioration of a machine; thus processing times of jobs increase and the production facility becomes less efficient. However, it is highly desirable to minimize the negative influence of this effect. In general, it can be done by formulating such a problem in the scheduling context and optimizing an order of jobs to minimize the given criterion. Therefore, on this basis a makespan minimization problem on a single machine with release dates and the aging effect is formulated, where the job processing times are described by non-decreasing functions dependent on fatigue (wear) of machine. It is proved that even the special cases of the problem are NP-hard. Moreover, some problems equivalences are shown and polynomially solvable cases are also provided. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n6/abs/jors200930a.html [article] Scheduling jobs under an aging effect [texte imprimé] / A. Janiak, Auteur ; R. Rudek, Auteur . - 2011 . - pp. 1041–1048. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 6 (Juin 2010) . - pp. 1041–1048 Mots-clés : Scheduling  Aging  effect  Deterioration  Computational  analysis Index. décimale : 001.424 Résumé : In this paper a scheduling problem that takes into consideration a phenomenon called ‘aging effect’ with reference to Computer Numerical Control drilling or cutting machines is investigated. In the aftermath of this effect an execution of jobs leads to a deterioration of a machine; thus processing times of jobs increase and the production facility becomes less efficient. However, it is highly desirable to minimize the negative influence of this effect. In general, it can be done by formulating such a problem in the scheduling context and optimizing an order of jobs to minimize the given criterion. Therefore, on this basis a makespan minimization problem on a single machine with release dates and the aging effect is formulated, where the job processing times are described by non-decreasing functions dependent on fatigue (wear) of machine. It is proved that even the special cases of the problem are NP-hard. Moreover, some problems equivalences are shown and polynomially solvable cases are also provided. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n6/abs/jors200930a.html

Scheduling jobs with position-dependent processing times / A. Janiak in Journal of the operational research society (JORS), Vol. 63 N° 7 (Juillet 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 7 (Juillet 2012) . - pp. 1018–1020 Titre : Scheduling jobs with position-dependent processing times Type de document : texte imprimé Auteurs : A. Janiak, Auteur ; M. Y. Kovalyov, Auteur Année de publication : 2012 Article en page(s) : pp. 1018–1020 Note générale : Operational research Langues : Anglais (eng) Mots-clés : Sequencing  Single  machine  Learning  effect  Computational  complexity Index. décimale : 001.424 Résumé : Bachman and Janiak provided a sketch of the proof that the problem 1|ri,pi(v)=ai/v|Cmax is NP-hard in the strong sense. However, they did not show how to avoid using harmonic numbers whose encoding is not pseudo-polynomial, which makes the proof incomplete. In this corrigendum, we provide a new complete proof. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n7/abs/jors201218a.html [article] Scheduling jobs with position-dependent processing times [texte imprimé] / A. Janiak, Auteur ; M. Y. Kovalyov, Auteur . - 2012 . - pp. 1018–1020. Operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 7 (Juillet 2012) . - pp. 1018–1020 Mots-clés : Sequencing  Single  machine  Learning  effect  Computational  complexity Index. décimale : 001.424 Résumé : Bachman and Janiak provided a sketch of the proof that the problem 1|ri,pi(v)=ai/v|Cmax is NP-hard in the strong sense. However, they did not show how to avoid using harmonic numbers whose encoding is not pseudo-polynomial, which makes the proof incomplete. In this corrigendum, we provide a new complete proof. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n7/abs/jors201218a.html