Multi-objective unrelated parallel machine scheduling: a Tabu-enhanced iterated Pareto greedy algorithm

This work proposes a high-performance algorithm for solving the multi-objective unrelated parallel machine scheduling problem. The proposed approach is based on the iterated Pareto greedy (IPG) algorithm but exploits the accessible Tabu list (TL) to enhance its performance. To demonstrate the superi...

Full description

Bibliographic Details

Published in:	International journal of production research Vol. 54; no. 4; pp. 1110 - 1121
Main Authors:	Lin, Shih-Wei, Ying, Kuo-Ching, Wu, Wen-Jie, Chiang, Yen-I
Format:	Journal Article
Language:	English
Published:	London Taylor & Francis 16.02.2016 Taylor & Francis LLC
Subjects:	Accessibility Algorithms Benchmarking Greedy algorithms Job shops multi-objective Optimization Pareto optimality Performance measurement Production scheduling Scheduling Tabu-enhanced iterated Pareto greedy algorithm unrelated parallel machine
ISSN:	0020-7543, 1366-588X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!