On the minimization of total weighted flow time with identical and uniform parallel machines

被引：46

作者：

Azizoglu, M ^{[1
]}

Kirca, O ^{[1
]}

机构：

[1] Middle E Tech Univ, Dept Ind Engn, TR-06531 Ankara, Turkey

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1999年 / 113卷 / 01期

关键词：

scheduling; parallel machines; branch and bound;

D O I：

10.1016/S0377-2217(97)00427-X

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider the NP-hard problem of scheduling jobs on identical parallel machines to minimize total weighted flow time. We discuss the properties that characterize the structure of an optimal solution, present a lower bound and propose a branch and bound algorithm. The algorithm is superior to prior methods presented in the literature. We also extend the algorithm to uniform parallel machines and solve medium-sized problem instances. (C) 1999 Elsevier Science B.V. All rights reserved.

引用

页码：91 / 100

页数：10

共 50 条

[1] Makespan minimization on identical parallel machines subject to minimum total flow-time
Gupta, Jatinder N. D.
Ho, Johnny C.
Ruiz-Torres, Alex J.
[J]. Journal of the Chinese Institute of Industrial Engineers, 2004, 21 (03): : 220 - 229
[2] A PTAS for minimizing the total weighted completion time on identical parallel machines
Skutella, M
Woeginger, GJ
[J]. MATHEMATICS OF OPERATIONS RESEARCH, 2000, 25 (01) : 63 - 75
[3] Minimizing total weighted completion time on identical parallel batch machines
Li, Shuguang
Li, Guojun
Qi, Xingqin
[J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2006, 17 (06) : 1441 - 1453
[4] Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
Kramer, Arthur
Iori, Manuel
Lacomme, Philippe
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 289 (03) : 825 - 840
[5] SCHEDULING IDENTICAL PARALLEL MACHINES TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME
BELOUADAH, H
POTTS, CN
[J]. DISCRETE APPLIED MATHEMATICS, 1994, 48 (03) : 201 - 218
[6] Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
Leung, JYT
Li, HB
Pinedo, M
[J]. NAVAL RESEARCH LOGISTICS, 2006, 53 (04) : 243 - 260
[7] Minimization of job waiting time variance on identical parallel machines
Xu, Xiaoyun
Ye, Nong
[J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 2007, 37 (05): : 917 - 927
[8] Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates
Jaeger, Sven
[J]. OPERATIONS RESEARCH LETTERS, 2018, 46 (05) : 505 - 509
[9] Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time
Kramer, Arthur
Dell'Amico, Mauro
Feillet, Dominique
Iori, Manuel
[J]. COMPUTERS & OPERATIONS RESEARCH, 2020, 123 (123)
[10] Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization
Rault, Tifenn
Sadi, Faiza
Billaut, Jean-Charles
Soukhal, Ameur
[J]. JOURNAL OF SCHEDULING, 2024, : 485 - 505

← 1 2 3 4 5 →