A bi-objective case of no-wait flowshops
This paper studies multi-objective no-wait flows hop scheduling problems to minimize both makespan and total tardiness. This paper mathematically formulates it as two effective multi-objective mixed integer linear programming models. The multi-objective models are then solved using a multiple criter...
Uložené v:
| Vydané v: | 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications s. 1048 - 1056 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
01.09.2010
|
| Predmet: | |
| ISBN: | 9781424464371, 1424464374 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | This paper studies multi-objective no-wait flows hop scheduling problems to minimize both makespan and total tardiness. This paper mathematically formulates it as two effective multi-objective mixed integer linear programming models. The multi-objective models are then solved using a multiple criteria decision making approach. Moreover, this paper proposes a novel multi-objective iterated local search algorithm incorporating with three types of local search engine, greedy and moderate and curtailed fashions. The algorithm is carefully evaluated for its performance against some available algorithms by means of multi-objective performance measures and statistical tools. The results show that the proposed solution method outperforms the others. |
|---|---|
| ISBN: | 9781424464371 1424464374 |
| DOI: | 10.1109/BICTA.2010.5645110 |