Minimizing total weighted flowtime subject to minimum makespan on two identical parallel machines

We study the problem of scheduling n jobs on two identical parallel processors or machines where an optimal schedule is defined as one with the shortest total weighted flowtime (i.e., the sum of the weighted completion time of all jobs), among the set of schedules with minimum makespan (i.e., the co...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of intelligent manufacturing Jg. 22; H. 2; S. 179 - 190
Hauptverfasser: Ho, Johnny C., López, Francisco J., Ruiz-Torres, Alex J., (Bill) Tseng, Tzu-Liang
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Boston Springer US 01.04.2011
Springer Nature B.V
Schlagworte:
Algorithms
Analysis
Business and Management
Control
Employment
Heuristic
Integer programming
Intelligent systems
Job shops
Machine tools
Machines
Manufacturing
Mathematical programming
Mechatronics
Optimization algorithms
Performance evaluation
Processes
Production
Robotics
Schedules
Scheduling
Studies
Hierarchical criteria
Makespan
Weighted flowtime
Parallel machines scheduling
ISSN:0956-5515, 1572-8145
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We study the problem of scheduling n jobs on two identical parallel processors or machines where an optimal schedule is defined as one with the shortest total weighted flowtime (i.e., the sum of the weighted completion time of all jobs), among the set of schedules with minimum makespan (i.e., the completion time of the last job finished). We present a two phase non-linear Integer Programming formulation for its solution, admittedly not to be practical or useful in most cases, but theoretically interesting since it models the problem. Thus, as an alternative, we propose an optimization algorithm, for small problems, and a heuristic, for large problems, to find optimal or near optimal solutions. Furthermore, we perform a computational study to evaluate and compare the effectiveness of the two proposed methods.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0956-5515
1572-8145
DOI:10.1007/s10845-009-0270-1