| Titre : | A note on parallel-machine due-window assignment (2012) |
| Auteurs : | A.P.P.A: Association pour la Prévention de la Pollution Atmosphériques, Auteur ; C.-L. Li, Auteur ; Q. Han, Auteur |
| Type de document : | Article : texte imprimé |
| Dans : | Journal of the operational research society (JORS) (Vol. 63 N° 6, Juin 2012) |
| Article en page(s) : | pp. 821–825 |
| Note générale : | Operational research |
| Langues : | Anglais |
| Index. décimale : | 001.424 |
| Tags : | Scheduling Parallel machines Earliness-tardiness Due window Assignment problem |
| Résumé : | We consider a due-window assignment problem on identical parallel machines, where the jobs have equal processing times and job-dependent earliness-tardiness costs. We would like to determine a ‘due window’ during which the jobs can be completed at no cost and to obtain a job schedule in which the jobs are penalized if they finish before or after the due window. The objective is to minimize the total earliness and tardiness job penalty, plus the cost associated with the size of the due window. We present an algorithm that can solve this problem in O(n3) time, which is an improvement of the O(n4) solution procedure developed by Mosheiov and Sarig. |
| DEWEY : | 001.424 |
| ISSN : | 0160-5682 |
| En ligne : | http://www.palgrave-journals.com/jors/journal/v63/n6/abs/jors201175a.html |
