Minimizing flowtime subject to optimal makespan on two identical parallel machines
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). Util...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sociedade Brasileira de Pesquisa Operacional
2000-06-01
|
| Series: | Pesquisa Operacional |
| Subjects: | |
| Online Access: | http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382000000100003 |