Job Completion Time Variance Minimization on Identical Parallel Machines

Bewaard in:
Bibliografische gegevens
Gepubliceerd in:IISE Annual Conference. Proceedings (2007), p. 974-979
Hoofdauteur: Chen, Yuerong
Andere auteurs: Li, Xueping, Kumanan, Somasundaram
Gepubliceerd in:
Institute of Industrial and Systems Engineers (IISE)
Onderwerpen:
Online toegang:Citation/Abstract
Full Text - PDF
Tags: Voeg label toe
Geen labels, Wees de eerste die dit record labelt!

MARC

LEADER 00000nab a2200000uu 4500
001 192456205
003 UK-CbPIL
035 |a 192456205 
045 2 |b d20070101  |b d20071231 
084 |a 102209  |2 nlm 
100 1 |a Chen, Yuerong 
245 1 |a Job Completion Time Variance Minimization on Identical Parallel Machines 
260 |b Institute of Industrial and Systems Engineers (IISE)  |c 2007 
513 |a Feature 
520 3 |a 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] 
653 |a Variance analysis 
653 |a Optimization 
653 |a Project management 
653 |a Production planning 
653 |a Manufacturing execution systems 
653 |a Job shops 
653 |a Just in time 
700 1 |a Li, Xueping 
700 1 |a Kumanan, Somasundaram 
773 0 |t IISE Annual Conference. Proceedings  |g (2007), p. 974-979 
786 0 |d ProQuest  |t Science Database 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/192456205/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch 
856 4 0 |3 Full Text - PDF  |u https://www.proquest.com/docview/192456205/fulltextPDF/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch