Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry |
| |
Institution: | 1. Instituto de Desarrollo y Diseño (INGAR, CONICET-UTN), Avellaneda 3657, (S3002GJC) Santa Fe, Argentina;2. Facultad de Ingeniería Química, Universidad Nacional del Litoral, Santiago del Estero 2829, Santa Fe, Argentina |
| |
Abstract: | This paper deals with the resolution of a bicriteria scheduling problem connected with the glass bottles production. The shop is made up of unrelated parallel machines and the aim is to compute a schedule of orders that maximizes the total margin and that minimizes the difference in machines workload. An algorithm to compute the set of all strict Pareto optima is offered and later extended into an interactive algorithm. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|