| Revista: | Pesquisa operacional |
| Base de datos: | PERIÓDICA |
| Número de sistema: | 000312990 |
| ISSN: | 0101-7438 |
| Autores: | Gupta, Jatinder N.D1 Ho, Johnny C2 |
| Instituciones: | 1Ball State University, Department of Management, Muncie, Indiana. Estados Unidos de América 2Columbus State University, Turner College of Business, Columbus, Georgia. Estados Unidos de América |
| Año: | 2000 |
| Periodo: | Jun |
| Volumen: | 20 |
| Número: | 1 |
| Paginación: | 5-17 |
| País: | Brasil |
| Idioma: | Inglés |
| Tipo de documento: | Artículo |
| Enfoque: | Analítico, descriptivo |
| Resumen en inglés | 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 |
| Disciplinas: | Ingeniería, Matemáticas, Ciencias de la computación |
| Palabras clave: | Ingeniería industrial, Matemáticas aplicadas, Máquinas paralelas, Desempeño de máquinas, Criterios jerárquicos, Minimización secuencial |
| Keyword: | Engineering, Mathematics, Computer science, Industrial engineering, Applied mathematics, Parallel machines, Machine performance, Hierarchical criteria, Flowtime minimization, Sequential minimization |
| Texto completo: | Texto completo (Ver HTML) |
