Minimizing flowtime subject to optimal makespan on two identical parallel machines

Minimizing flowtime subject to optimal makespan on two identical parallel machines

0.00 Avg rating0 Votes
Article ID: iaor20022300
Country: Brazil
Volume: 20
Issue: 1
Start Page Number: 5
End Page Number: 17
Publication Date: Jun 2000
Journal: Pesquisa Operacional
Authors: ,
Keywords: optimization
Abstract:

We consider the problem of scheduling jobs on two parallel identical machines where an optimal schedule is defined as one that gives the smallest total flowtime (the sum of the completion time of all jobs) among the set of schedules with optimal makespan (the completion time of the latest job). Utilizing an existing optimization algorithm for the minimization of makespan, we propose an algorithm to determine optimal schedules for this problem. We empirically show that the proposed algorithm can quickly find optimal schedules for problems containing a large number of jobs.

Reviews

Required fields are marked *. Your email address will not be published.