Imatge de la portada

Job Completion Time Variance Minimization on Identical Parallel Machines

Guardat en:
Publicat a:IISE Annual Conference. Proceedings (2007), p. 974-979
Autor principal: Chen, Yuerong
Altres autors: Li, Xueping, Kumanan, Somasundaram
Publicat:
Institute of Industrial and Systems Engineers (IISE)
Matèries:
Variance analysis
Optimization
Project management
Production planning
Manufacturing execution systems
Job shops
Just in time
Accés en línia:Citation/Abstract
Full Text - PDF
Etiquetes: Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
Resum:The paper addresses the problem of scheduling n jobs on m identical parallel machines so as to minimize the job completion time variance (CTV), which is closely related to service stability. We focus on the unrestricted case such that an idle time is permitted to insert before the job processing. We prove that the mean completion time on each machine should be the same under an optimal schedule. We also prove a series of favorable properties, based on which we propose a heuristic algorithm that reduces CTV more efficiently than the existing scheduling algorithms do. [PUBLICATION ABSTRACT]
Font:Science Database