| A Note on Single Machine Scheduling with Coefficient of Completion Time Variation Minimization |
| |
| 作者姓名： | CHUNFU JIA FENGSHENG TU |
| |
| 作者单位： | Department of Computer and System Sciences，Nankai University，Tianjin，300071 |
| |
| 摘 要： | 1.IntroductionGivenasetN~{1,2,...,n},n>1,ofindependentandsimultaneouslyavailablejobswhicharetobeprocessednonpreemptivelyonasinglemachine,jobirequiresapositiveprocessingtimepiandisassignedapositiveweightfi,iEN.Let11bethesetofn!possiblepermutationsofintegers1,2,...,n,and7~{l],2]!...In]}E11beajobsequencewhichdenotesthatjobk]isthekthjobtobeprocessedonthemachine.Assumethatthemachinestratstoprocessthefirstjobattimezero.TheproblemistofindajobsequenceT*E11tominimizewhereCi]isthecompletiontime…
|
A Note on Single Machine Scheduling with Coefficient of Completion Time Variation Minimization |
| |
| CHUNFU JIA FENGSHENG TU.A Note on Single Machine Scheduling with Coefficient of Completion Time Variation Minimization[J].OR Transactions,1998(4). |
| |
| Authors: | CHUNFU JIA FENGSHENG TU |
| |
| Abstract: | An algorithm in O(n2) time is derived, which solves the single machine schedulingfor minimizing the coefficient of completion time variation with equal processing times. |
| |
| Keywords: | single machine scheduling HLP inequality coefficient of completiontime variation |
| 本文献已被 CNKI 等数据库收录！ |
|
