Minimizing flowtime subject to optimal makespan on two identical parallel machines

AUTOR(ES)

Gupta, Jatinder N. D., Ho, Johnny C.

FONTE

Pesquisa Operacional

DATA DE PUBLICAÇÃO

2000-06

RESUMO

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.

Documentos Relacionados

• Algoritmos bio-inspirados para minimização do makespan do problema de escalonamento de produção
• Optimal Auctions in a General Model of Identical Goods
• Structure Comparison and Optimal Design of 6-RUS Parallel Manipulator Based on Kinematic and Dynamic Performances
• Selection of optimal process parameters for minimizing burr size in drilling using Taguchi's quality loss function approach
• Optimal paths for minimizing lost available work during heat transfer processes with a generalized heat transfer law