Cover Image

A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows

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.
Year of publication:
2009
Authors: Sedeño-Noda, A. ; Pablo, D. Alcaide López de ; González-Martín, C.
Published in:
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 196.2009, 1, p. 140-154
Publisher: Elsevier
Keywords: 90B35 90B10 90C27 Pre-emptive open-shop scheduling Bicriteria optimization Network flow approach Time-windows Max-flow parametrical algorithm
Online Resource
Check full text access |
Check Google Scholar
In libraries world-wide (WorldCat)
In German libraries (KVK)
subito order
I need help
Type of publication: Article
Source:
Persistent link: https://www.econbiz.de/10005347085
Similar items by person