Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
477294 | European Journal of Operational Research | 2009 | 15 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
A. Sedeño-Noda, D. Alcaide López de Pablo, C. González-Martín,