Minimizing flowtime subject to optimal makespan on two identical parallel machines



Título del documento: Minimizing flowtime subject to optimal makespan on two identical parallel machines
Revista: Pesquisa operacional
Base de datos: PERIÓDICA
Número de sistema: 000312990
ISSN: 0101-7438
Autors: 1
2
Institucions: 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
Any:
Període: Jun
Volum: 20
Número: 1
Paginació: 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
Disciplines Ingeniería,
Matemáticas,
Ciencias de la computación
Paraules clau: 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
Text complet: Texto completo (Ver HTML)