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

Full description

Saved in:

Bibliographic Details
Published in:	2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications pp. 1048 - 1056
Main Authors:	Jenabi, M, Naderi, B, Ghomi, S M T F
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.09.2010
Subjects:	Engines Mixed integer linear programming model Multi-objective iterated local search algorithm No-wait flowshop scheduling
ISBN:	9781424464371, 1424464374
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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