Documents disponibles écrits par cet auteur

Single-machine scheduling of proportionally deteriorating jobs by two agents / S. Gawiejnowicz in Journal of the operational research society (JORS), Vol. 62 N° 11 (Novembre 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 1983–1991 Titre : Single-machine scheduling of proportionally deteriorating jobs by two agents Type de document : texte imprimé Auteurs : S. Gawiejnowicz, Auteur ; W-C. Lee, Auteur ; C.L. Lin, Auteur Année de publication : 2011 Article en page(s) : pp. 1983–1991 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Agent  scheduling  Deteriorating  jobs  Total  tardiness  The  number  of  tardy  jobs  Branch-and-bound  algorithm  Evolutionary  algorithm Index. décimale : 001.424 Résumé : We consider a problem of scheduling a set of independent jobs by two agents on a single machine. Every agent has its own subset of jobs to be scheduled and uses its own optimality criterion. The processing time of each job proportionally deteriorates with respect to the starting time of the job. The problem is to find a schedule that minimizes the total tardiness of the first agent, provided that no tardy job is allowed for the second agent. We prove basic properties of the problem and give a lower bound on the optimal value of the total tardiness criterion. On the basis of these results, we propose a branch-and-bound algorithm and an evolutionary algorithm for the problem. Computational experiments show that the exact algorithm solves instances up to 50 jobs in a reasonably short time and that solutions obtained by the metaheuristic are close to optimal ones. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010171a.html [article] Single-machine scheduling of proportionally deteriorating jobs by two agents [texte imprimé] / S. Gawiejnowicz, Auteur ; W-C. Lee, Auteur ; C.L. Lin, Auteur . - 2011 . - pp. 1983–1991. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 1983–1991 Mots-clés : Agent  scheduling  Deteriorating  jobs  Total  tardiness  The  number  of  tardy  jobs  Branch-and-bound  algorithm  Evolutionary  algorithm Index. décimale : 001.424 Résumé : We consider a problem of scheduling a set of independent jobs by two agents on a single machine. Every agent has its own subset of jobs to be scheduled and uses its own optimality criterion. The processing time of each job proportionally deteriorates with respect to the starting time of the job. The problem is to find a schedule that minimizes the total tardiness of the first agent, provided that no tardy job is allowed for the second agent. We prove basic properties of the problem and give a lower bound on the optimal value of the total tardiness criterion. On the basis of these results, we propose a branch-and-bound algorithm and an evolutionary algorithm for the problem. Computational experiments show that the exact algorithm solves instances up to 50 jobs in a reasonably short time and that solutions obtained by the metaheuristic are close to optimal ones. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010171a.html