A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows |
| |
Authors: | A Sedeño-Noda D Alcaide López de PabloC González-Martín |
| |
Institution: | Departamento de Estadística e Investigación Operativa y Computación, University of La Laguna, La Laguna, Tenerife, Spain |
| |
Abstract: | This paper deals with several bicriteria open-shop scheduling problems where jobs are pre-emptable and their corresponding time-windows must be strictly respected. The criteria are a performance cost and the makespan. Network flow approaches are used in a lexmin procedure with a bounded makespan and the considered bicriteria problems are solved. Finally, the computational complexity of the algorithm and a numerical example are reported. |
| |
Keywords: | 90B35 90B10 90C27 |
本文献已被 ScienceDirect 等数据库收录! |