Documents disponibles écrits par cet auteur

Parallel machines scheduling with a deteriorating maintenance activity / J-J. Wang in Journal of the operational research society (JORS), Vol. 62 N° 10 (Octobre 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1898–1902 Titre : Parallel machines scheduling with a deteriorating maintenance activity Type de document : texte imprimé Auteurs : J-J. Wang, Auteur ; Wang, J.-B., Auteur ; F. Liu, Auteur Année de publication : 2011 Article en page(s) : pp. 1898–1902 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling  Parallel  identical  machines  Maintenance  activity  Polynomial  algorithm Index. décimale : 001.424 Résumé : In this paper, we consider parallel identical machines scheduling problems with a deteriorating maintenance activity. In this model, each machine has a deteriorating maintenance activity, that is, delaying the maintenance increases the time required to perform it. We need to make a decision on when to schedule the deteriorating maintenance activities and the sequence of jobs to minimize total completion time. We provide a polynomial time algorithm to solve the total completion time minimization problem. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010143a.html [article] Parallel machines scheduling with a deteriorating maintenance activity [texte imprimé] / J-J. Wang, Auteur ; Wang, J.-B., Auteur ; F. Liu, Auteur . - 2011 . - pp. 1898–1902. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1898–1902 Mots-clés : Scheduling  Parallel  identical  machines  Maintenance  activity  Polynomial  algorithm Index. décimale : 001.424 Résumé : In this paper, we consider parallel identical machines scheduling problems with a deteriorating maintenance activity. In this model, each machine has a deteriorating maintenance activity, that is, delaying the maintenance increases the time required to perform it. We need to make a decision on when to schedule the deteriorating maintenance activities and the sequence of jobs to minimize total completion time. We provide a polynomial time algorithm to solve the total completion time minimization problem. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010143a.html

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]  in Journal 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

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]  in Journal 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

Single-machine scheduling with a sum-of-actual-processing-time-based learning effect / Wang, J.-B. in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 172–177 Titre : Single-machine scheduling with a sum-of-actual-processing-time-based learning effect Type de document : texte imprimé Auteurs : Wang, J.-B., Auteur Année de publication : 2011 Article en page(s) : pp. 172–177 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling  Single  machine  Learning  effect Index. décimale : 001.424 Résumé : In this paper we consider the single-machine scheduling problems with a sum-of-actual-processing-time-based learning effect. By the sum-of-actual-processing-time-based learning effect, we mean that the processing time of a job is defined by a function of the sum of the actual processing time of the already processed jobs. We show that even with the introduction of the sum-of-actual-processing-time-based learning effect to job processing times, the makespan minimization problem, the total completion time minimization problem, the total completion time square minimization problem, and some special cases of the total weighted completion time minimization problem and the maximum lateness minimization problem remain polynomially solvable, respectively. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008146a.html [article] Single-machine scheduling with a sum-of-actual-processing-time-based learning effect [texte imprimé] / Wang, J.-B., Auteur . - 2011 . - pp. 172–177. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 172–177 Mots-clés : Scheduling  Single  machine  Learning  effect Index. décimale : 001.424 Résumé : In this paper we consider the single-machine scheduling problems with a sum-of-actual-processing-time-based learning effect. By the sum-of-actual-processing-time-based learning effect, we mean that the processing time of a job is defined by a function of the sum of the actual processing time of the already processed jobs. We show that even with the introduction of the sum-of-actual-processing-time-based learning effect to job processing times, the makespan minimization problem, the total completion time minimization problem, the total completion time square minimization problem, and some special cases of the total weighted completion time minimization problem and the maximum lateness minimization problem remain polynomially solvable, respectively. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008146a.html

Worst-case analysis for flow shop scheduling problems with an exponential learning effect / Wang, J.-B. in Journal of the operational research society (JORS), Vol. 63 N° 1 (Janvier 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 1 (Janvier 2012) . - pp. 130–137 Titre : Worst-case analysis for flow shop scheduling problems with an exponential learning effect Type de document : texte imprimé Auteurs : Wang, J.-B., Auteur ; M.-Z. Wang, Auteur Année de publication : 2012 Article en page(s) : pp. 130–137 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling  Flow  shop  Learning  effect  Worst-case  analysis Index. décimale : 001.424 Résumé : A real industrial production phenomenon, referred to as learning effects, has drawn increasing attention. However, most research on this issue considers only single machine problems. Motivated by this limitation, this paper considers flow shop scheduling problems with an exponential learning effect. By the exponential learning effect, we mean that the processing time of a job is defined by an exponent function of its position in a processing permutation. The objective is to minimize one of the four regular performance criteria, namely, the total completion time, the total weighted completion time, the discounted total weighted completion time, and the sum of the quadratic job completion times. We present heuristic algorithms by using the optimal permutations for the corresponding single-machine scheduling problems. We also analyse the worst-case bound of our heuristic algorithms. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n1/abs/jors201140a.html [article] Worst-case analysis for flow shop scheduling problems with an exponential learning effect [texte imprimé] / Wang, J.-B., Auteur ; M.-Z. Wang, Auteur . - 2012 . - pp. 130–137. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 1 (Janvier 2012) . - pp. 130–137 Mots-clés : Scheduling  Flow  shop  Learning  effect  Worst-case  analysis Index. décimale : 001.424 Résumé : A real industrial production phenomenon, referred to as learning effects, has drawn increasing attention. However, most research on this issue considers only single machine problems. Motivated by this limitation, this paper considers flow shop scheduling problems with an exponential learning effect. By the exponential learning effect, we mean that the processing time of a job is defined by an exponent function of its position in a processing permutation. The objective is to minimize one of the four regular performance criteria, namely, the total completion time, the total weighted completion time, the discounted total weighted completion time, and the sum of the quadratic job completion times. We present heuristic algorithms by using the optimal permutations for the corresponding single-machine scheduling problems. We also analyse the worst-case bound of our heuristic algorithms. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n1/abs/jors201140a.html