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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of production research Jg. 50; H. 10; S. 2592 - 2608
Hauptverfasser: Naderi, B., Aminnayeri, M., Piri, M., Ha'iri Yazdi, M.H.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Abingdon Taylor & Francis Group 15.05.2012
Taylor & Francis
Taylor & Francis LLC
Schlagworte:
Algorithms
Applied sciences
Decision theory. Utility theory
Exact sciences and technology
Fuzzy
Fuzzy logic
Integer programming
Inventory control, production control. Distribution
Job shops
Linear programming
Mathematical analysis
Mathematical models
Mathematical programming
Mixed integer
mixed integer linear programming model
multi-objective iterated local search algorithm
Multiple criteria decision making
no-wait flowshop scheduling
Operational research and scientific management
Operational research. Management science
Optimization algorithms
Production scheduling
Scheduling
Scheduling, sequencing
Studies
Performance evaluation
Local search
Statistical analysis
Multicriteria analysis
Decision making
Search engine
Multiobjective programming
Linear programming
Mixed integer programming
Scheduling
Fuzzy programming
Makespan
Real time
Modeling
Delay
Search algorithm
Greedy algorithm
Flow shop
mixed integer linear programming model
multi-objective iterated local search algorithm
no-wait flowshop scheduling
ISSN:0020-7543, 1366-588X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie: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