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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of intelligent manufacturing Vol. 22; no. 2; pp. 179 - 190
Main Authors:	Ho, Johnny C., López, Francisco J., Ruiz-Torres, Alex J., (Bill) Tseng, Tzu-Liang
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.04.2011 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!