Multi-objective no-wait flowshop scheduling problems: models and algorithms
This article studies multi-objective no-wait flowshop scheduling problems to minimise both makespan and total tardiness. This problem is commonly denoted by . This article mathematically formulates the problem using two effective multi-objective mixed integer linear programming models. The multi-obj...
Saved in:
| Published in: | International journal of production research Vol. 50; no. 10; pp. 2592 - 2608 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Abingdon
Taylor & Francis Group
15.05.2012
Taylor & Francis Taylor & Francis LLC |
| Subjects: | |
| ISSN: | 0020-7543, 1366-588X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This article studies multi-objective no-wait flowshop scheduling problems to minimise both makespan and total tardiness. This problem is commonly denoted by
. This article mathematically formulates the problem using two effective multi-objective mixed integer linear programming models. The multi-objective mathematical models are then solved by a multiple criteria decision making approach, called Fuzzy programming method. Moreover, the article proposes a novel multi-objective iterated local search algorithm incorporating three types of local search engine: greedy, moderate and curtailed fashions. The algorithm is carefully evaluated for its performance against two available algorithms by means of multi-objective performance measures and statistical tools. The results show that the proposed solution method outperforms the others. |
|---|---|
| Bibliography: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| ISSN: | 0020-7543 1366-588X |
| DOI: | 10.1080/00207543.2010.543937 |